./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label44.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_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 0353c543ba4bfdaef5ec6741581eb9d536c42e96 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:44:59,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:44:59,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:44:59,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:44:59,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:44:59,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:44:59,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:44:59,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:44:59,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:44:59,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:44:59,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:44:59,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:44:59,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:44:59,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:44:59,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:44:59,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:44:59,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:44:59,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:44:59,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:44:59,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:44:59,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:44:59,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:44:59,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:44:59,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:44:59,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:44:59,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:44:59,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:44:59,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:44:59,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:44:59,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:44:59,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:44:59,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:44:59,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:44:59,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:44:59,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:44:59,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:44:59,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:44:59,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:44:59,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:44:59,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:44:59,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:44:59,383 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:44:59,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:44:59,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:44:59,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:44:59,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:44:59,397 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:44:59,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:44:59,398 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:44:59,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:44:59,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:44:59,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:44:59,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:44:59,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:44:59,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:44:59,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:44:59,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:44:59,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:44:59,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:44:59,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:44:59,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:44:59,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:44:59,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:44:59,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:44:59,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:44:59,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:44:59,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:44:59,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:44:59,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:44:59,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:44:59,403 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_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 -> 0353c543ba4bfdaef5ec6741581eb9d536c42e96 [2019-11-20 06:44:59,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:44:59,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:44:59,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:44:59,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:44:59,552 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:44:59,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label44.c [2019-11-20 06:44:59,609 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/data/7be624980/c5af5115655443b1974beb87be509db9/FLAGb6ab8f516 [2019-11-20 06:45:00,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:45:00,238 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/sv-benchmarks/c/eca-rers2012/Problem15_label44.c [2019-11-20 06:45:00,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/data/7be624980/c5af5115655443b1974beb87be509db9/FLAGb6ab8f516 [2019-11-20 06:45:00,420 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/data/7be624980/c5af5115655443b1974beb87be509db9 [2019-11-20 06:45:00,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:45:00,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:45:00,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:00,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:45:00,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:45:00,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:00" (1/1) ... [2019-11-20 06:45:00,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6e5914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:00, skipping insertion in model container [2019-11-20 06:45:00,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:00" (1/1) ... [2019-11-20 06:45:00,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:45:00,537 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:45:01,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:01,322 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:45:01,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:01,599 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:45:01,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01 WrapperNode [2019-11-20 06:45:01,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:01,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:45:01,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:45:01,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:45:01,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:45:01,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:45:01,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:45:01,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:45:01,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... [2019-11-20 06:45:01,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:45:01,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:45:01,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:45:01,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:45:01,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 06:45:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:45:02,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:45:05,158 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:45:05,158 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 06:45:05,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:05 BoogieIcfgContainer [2019-11-20 06:45:05,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:45:05,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:45:05,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:45:05,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:45:05,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:45:00" (1/3) ... [2019-11-20 06:45:05,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de327a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:05, skipping insertion in model container [2019-11-20 06:45:05,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:01" (2/3) ... [2019-11-20 06:45:05,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de327a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:05, skipping insertion in model container [2019-11-20 06:45:05,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:05" (3/3) ... [2019-11-20 06:45:05,171 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label44.c [2019-11-20 06:45:05,180 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:45:05,189 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:45:05,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:45:05,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:45:05,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:45:05,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:45:05,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:45:05,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:45:05,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:45:05,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:45:05,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:45:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 06:45:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 06:45:05,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:05,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:05,266 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2019-11-20 06:45:05,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:05,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022530381] [2019-11-20 06:45:05,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:05,608 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 06:45:05,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022530381] [2019-11-20 06:45:05,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:05,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:45:05,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070261031] [2019-11-20 06:45:05,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:05,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:05,630 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 06:45:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:09,938 INFO L93 Difference]: Finished difference Result 1457 states and 2706 transitions. [2019-11-20 06:45:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:09,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 06:45:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:09,973 INFO L225 Difference]: With dead ends: 1457 [2019-11-20 06:45:09,973 INFO L226 Difference]: Without dead ends: 965 [2019-11-20 06:45:09,982 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 06:45:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-11-20 06:45:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 662. [2019-11-20 06:45:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-20 06:45:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 979 transitions. [2019-11-20 06:45:10,072 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 979 transitions. Word has length 66 [2019-11-20 06:45:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:10,072 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 979 transitions. [2019-11-20 06:45:10,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 979 transitions. [2019-11-20 06:45:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 06:45:10,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:10,078 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:10,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 333594229, now seen corresponding path program 1 times [2019-11-20 06:45:10,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:10,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841372483] [2019-11-20 06:45:10,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:10,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841372483] [2019-11-20 06:45:10,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:10,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:45:10,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138801652] [2019-11-20 06:45:10,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:45:10,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:45:10,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:45:10,303 INFO L87 Difference]: Start difference. First operand 662 states and 979 transitions. Second operand 5 states. [2019-11-20 06:45:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:13,938 INFO L93 Difference]: Finished difference Result 2244 states and 3236 transitions. [2019-11-20 06:45:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:13,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-20 06:45:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:13,949 INFO L225 Difference]: With dead ends: 2244 [2019-11-20 06:45:13,949 INFO L226 Difference]: Without dead ends: 1584 [2019-11-20 06:45:13,951 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 06:45:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-11-20 06:45:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1277. [2019-11-20 06:45:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-11-20 06:45:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1746 transitions. [2019-11-20 06:45:13,997 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1746 transitions. Word has length 131 [2019-11-20 06:45:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:13,999 INFO L462 AbstractCegarLoop]: Abstraction has 1277 states and 1746 transitions. [2019-11-20 06:45:14,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:45:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1746 transitions. [2019-11-20 06:45:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 06:45:14,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:14,014 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:14,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1428135620, now seen corresponding path program 1 times [2019-11-20 06:45:14,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:14,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669495029] [2019-11-20 06:45:14,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:14,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669495029] [2019-11-20 06:45:14,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:14,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:45:14,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449840712] [2019-11-20 06:45:14,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:14,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:14,166 INFO L87 Difference]: Start difference. First operand 1277 states and 1746 transitions. Second operand 4 states. [2019-11-20 06:45:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:16,931 INFO L93 Difference]: Finished difference Result 4360 states and 6098 transitions. [2019-11-20 06:45:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:16,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-20 06:45:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:16,949 INFO L225 Difference]: With dead ends: 4360 [2019-11-20 06:45:16,950 INFO L226 Difference]: Without dead ends: 3085 [2019-11-20 06:45:16,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2019-11-20 06:45:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 3080. [2019-11-20 06:45:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-11-20 06:45:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 3988 transitions. [2019-11-20 06:45:17,011 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 3988 transitions. Word has length 136 [2019-11-20 06:45:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:17,012 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 3988 transitions. [2019-11-20 06:45:17,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3988 transitions. [2019-11-20 06:45:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 06:45:17,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:17,016 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 06:45:17,016 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash 461226345, now seen corresponding path program 1 times [2019-11-20 06:45:17,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:17,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656349294] [2019-11-20 06:45:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-20 06:45:17,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656349294] [2019-11-20 06:45:17,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500073819] [2019-11-20 06:45:17,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 06:45:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:17,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:45:17,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:17,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:45:17,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-20 06:45:17,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989630522] [2019-11-20 06:45:17,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:17,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:17,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:17,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:17,467 INFO L87 Difference]: Start difference. First operand 3080 states and 3988 transitions. Second operand 3 states. [2019-11-20 06:45:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:19,347 INFO L93 Difference]: Finished difference Result 8252 states and 10870 transitions. [2019-11-20 06:45:19,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:19,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-20 06:45:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:19,372 INFO L225 Difference]: With dead ends: 8252 [2019-11-20 06:45:19,373 INFO L226 Difference]: Without dead ends: 5174 [2019-11-20 06:45:19,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 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 06:45:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2019-11-20 06:45:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 4277. [2019-11-20 06:45:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4277 states. [2019-11-20 06:45:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 5339 transitions. [2019-11-20 06:45:19,466 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 5339 transitions. Word has length 232 [2019-11-20 06:45:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:19,466 INFO L462 AbstractCegarLoop]: Abstraction has 4277 states and 5339 transitions. [2019-11-20 06:45:19,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:45:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 5339 transitions. [2019-11-20 06:45:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-20 06:45:19,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:19,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:19,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:45:19,678 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1527180443, now seen corresponding path program 1 times [2019-11-20 06:45:19,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:19,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782569398] [2019-11-20 06:45:19,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 06:45:20,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782569398] [2019-11-20 06:45:20,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:20,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:45:20,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393691819] [2019-11-20 06:45:20,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:45:20,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:20,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:45:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:45:20,250 INFO L87 Difference]: Start difference. First operand 4277 states and 5339 transitions. Second operand 5 states. [2019-11-20 06:45:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:23,195 INFO L93 Difference]: Finished difference Result 9452 states and 11656 transitions. [2019-11-20 06:45:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:23,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 338 [2019-11-20 06:45:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:23,223 INFO L225 Difference]: With dead ends: 9452 [2019-11-20 06:45:23,223 INFO L226 Difference]: Without dead ends: 5177 [2019-11-20 06:45:23,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:45:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2019-11-20 06:45:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 4875. [2019-11-20 06:45:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4875 states. [2019-11-20 06:45:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5967 transitions. [2019-11-20 06:45:23,321 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5967 transitions. Word has length 338 [2019-11-20 06:45:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:23,323 INFO L462 AbstractCegarLoop]: Abstraction has 4875 states and 5967 transitions. [2019-11-20 06:45:23,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:45:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5967 transitions. [2019-11-20 06:45:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-20 06:45:23,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:23,332 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:23,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1227352119, now seen corresponding path program 1 times [2019-11-20 06:45:23,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:23,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577031284] [2019-11-20 06:45:23,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 06:45:23,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577031284] [2019-11-20 06:45:23,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:23,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:45:23,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845543669] [2019-11-20 06:45:23,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:23,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:23,801 INFO L87 Difference]: Start difference. First operand 4875 states and 5967 transitions. Second operand 4 states. [2019-11-20 06:45:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:26,419 INFO L93 Difference]: Finished difference Result 13047 states and 16083 transitions. [2019-11-20 06:45:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:26,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-11-20 06:45:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:26,458 INFO L225 Difference]: With dead ends: 13047 [2019-11-20 06:45:26,458 INFO L226 Difference]: Without dead ends: 8174 [2019-11-20 06:45:26,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2019-11-20 06:45:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 6375. [2019-11-20 06:45:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2019-11-20 06:45:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 7715 transitions. [2019-11-20 06:45:26,589 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 7715 transitions. Word has length 412 [2019-11-20 06:45:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:26,590 INFO L462 AbstractCegarLoop]: Abstraction has 6375 states and 7715 transitions. [2019-11-20 06:45:26,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 7715 transitions. [2019-11-20 06:45:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-20 06:45:26,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:26,599 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:26,599 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2078614052, now seen corresponding path program 1 times [2019-11-20 06:45:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:26,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703938156] [2019-11-20 06:45:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:27,153 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-11-20 06:45:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 137 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:27,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703938156] [2019-11-20 06:45:27,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565786975] [2019-11-20 06:45:27,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 06:45:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:28,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:45:28,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:28,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:45:28,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-11-20 06:45:28,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765623923] [2019-11-20 06:45:28,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:28,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:45:28,145 INFO L87 Difference]: Start difference. First operand 6375 states and 7715 transitions. Second operand 3 states. [2019-11-20 06:45:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:29,541 INFO L93 Difference]: Finished difference Result 13347 states and 16095 transitions. [2019-11-20 06:45:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:29,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-11-20 06:45:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:29,571 INFO L225 Difference]: With dead ends: 13347 [2019-11-20 06:45:29,571 INFO L226 Difference]: Without dead ends: 6974 [2019-11-20 06:45:29,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:45:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-11-20 06:45:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6673. [2019-11-20 06:45:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6673 states. [2019-11-20 06:45:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 7850 transitions. [2019-11-20 06:45:29,678 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 7850 transitions. Word has length 417 [2019-11-20 06:45:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:29,679 INFO L462 AbstractCegarLoop]: Abstraction has 6673 states and 7850 transitions. [2019-11-20 06:45:29,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:45:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 7850 transitions. [2019-11-20 06:45:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-20 06:45:29,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:29,688 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:29,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:45:29,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1305480874, now seen corresponding path program 1 times [2019-11-20 06:45:29,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:29,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608741434] [2019-11-20 06:45:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 06:45:30,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608741434] [2019-11-20 06:45:30,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:30,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:45:30,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935885386] [2019-11-20 06:45:30,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:30,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:30,292 INFO L87 Difference]: Start difference. First operand 6673 states and 7850 transitions. Second operand 4 states. [2019-11-20 06:45:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:33,217 INFO L93 Difference]: Finished difference Result 13344 states and 15700 transitions. [2019-11-20 06:45:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:33,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-11-20 06:45:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:33,238 INFO L225 Difference]: With dead ends: 13344 [2019-11-20 06:45:33,238 INFO L226 Difference]: Without dead ends: 6673 [2019-11-20 06:45:33,245 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 06:45:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2019-11-20 06:45:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6672. [2019-11-20 06:45:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6672 states. [2019-11-20 06:45:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6672 states to 6672 states and 7565 transitions. [2019-11-20 06:45:33,323 INFO L78 Accepts]: Start accepts. Automaton has 6672 states and 7565 transitions. Word has length 434 [2019-11-20 06:45:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:33,324 INFO L462 AbstractCegarLoop]: Abstraction has 6672 states and 7565 transitions. [2019-11-20 06:45:33,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6672 states and 7565 transitions. [2019-11-20 06:45:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-11-20 06:45:33,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:33,331 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:33,331 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:33,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1447157885, now seen corresponding path program 1 times [2019-11-20 06:45:33,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:33,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792861368] [2019-11-20 06:45:33,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-20 06:45:33,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792861368] [2019-11-20 06:45:33,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:33,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:45:33,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914213536] [2019-11-20 06:45:33,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:33,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:33,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:33,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:45:33,956 INFO L87 Difference]: Start difference. First operand 6672 states and 7565 transitions. Second operand 3 states. [2019-11-20 06:45:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:35,532 INFO L93 Difference]: Finished difference Result 15733 states and 18096 transitions. [2019-11-20 06:45:35,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:35,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 530 [2019-11-20 06:45:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:35,548 INFO L225 Difference]: With dead ends: 15733 [2019-11-20 06:45:35,548 INFO L226 Difference]: Without dead ends: 9063 [2019-11-20 06:45:35,555 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 06:45:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2019-11-20 06:45:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2019-11-20 06:45:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2019-11-20 06:45:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 10362 transitions. [2019-11-20 06:45:35,661 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 10362 transitions. Word has length 530 [2019-11-20 06:45:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:35,662 INFO L462 AbstractCegarLoop]: Abstraction has 9063 states and 10362 transitions. [2019-11-20 06:45:35,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:45:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 10362 transitions. [2019-11-20 06:45:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-11-20 06:45:35,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:35,671 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:35,672 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1866992391, now seen corresponding path program 1 times [2019-11-20 06:45:35,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:35,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208318198] [2019-11-20 06:45:35,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 660 proven. 3 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 06:45:37,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208318198] [2019-11-20 06:45:37,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466695623] [2019-11-20 06:45:37,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 06:45:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:37,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 06:45:37,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:45:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 624 proven. 39 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 06:45:37,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:45:37,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-20 06:45:37,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095619969] [2019-11-20 06:45:37,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 06:45:37,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 06:45:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:45:37,935 INFO L87 Difference]: Start difference. First operand 9063 states and 10362 transitions. Second operand 9 states. [2019-11-20 06:45:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:44,147 INFO L93 Difference]: Finished difference Result 23362 states and 26503 transitions. [2019-11-20 06:45:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 06:45:44,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 621 [2019-11-20 06:45:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:44,170 INFO L225 Difference]: With dead ends: 23362 [2019-11-20 06:45:44,170 INFO L226 Difference]: Without dead ends: 10856 [2019-11-20 06:45:44,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 618 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-20 06:45:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10856 states. [2019-11-20 06:45:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10856 to 7865. [2019-11-20 06:45:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7865 states. [2019-11-20 06:45:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7865 states to 7865 states and 8367 transitions. [2019-11-20 06:45:44,294 INFO L78 Accepts]: Start accepts. Automaton has 7865 states and 8367 transitions. Word has length 621 [2019-11-20 06:45:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:44,295 INFO L462 AbstractCegarLoop]: Abstraction has 7865 states and 8367 transitions. [2019-11-20 06:45:44,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 06:45:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 7865 states and 8367 transitions. [2019-11-20 06:45:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-11-20 06:45:44,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:44,304 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:44,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:45:44,508 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1111780767, now seen corresponding path program 1 times [2019-11-20 06:45:44,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:44,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548971058] [2019-11-20 06:45:44,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-11-20 06:45:45,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548971058] [2019-11-20 06:45:45,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:45,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:45:45,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27850971] [2019-11-20 06:45:45,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:45,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:45:45,069 INFO L87 Difference]: Start difference. First operand 7865 states and 8367 transitions. Second operand 3 states. [2019-11-20 06:45:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:46,387 INFO L93 Difference]: Finished difference Result 15726 states and 16730 transitions. [2019-11-20 06:45:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:46,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2019-11-20 06:45:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:46,403 INFO L225 Difference]: With dead ends: 15726 [2019-11-20 06:45:46,404 INFO L226 Difference]: Without dead ends: 7863 [2019-11-20 06:45:46,411 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 06:45:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2019-11-20 06:45:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7863. [2019-11-20 06:45:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7863 states. [2019-11-20 06:45:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7863 states to 7863 states and 8363 transitions. [2019-11-20 06:45:46,496 INFO L78 Accepts]: Start accepts. Automaton has 7863 states and 8363 transitions. Word has length 663 [2019-11-20 06:45:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:46,497 INFO L462 AbstractCegarLoop]: Abstraction has 7863 states and 8363 transitions. [2019-11-20 06:45:46,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:45:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7863 states and 8363 transitions. [2019-11-20 06:45:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-11-20 06:45:46,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:46,515 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:46,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash 696170776, now seen corresponding path program 1 times [2019-11-20 06:45:46,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:46,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997008394] [2019-11-20 06:45:46,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 525 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-20 06:45:47,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997008394] [2019-11-20 06:45:47,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748627545] [2019-11-20 06:45:47,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 06:45:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:47,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:45:47,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-20 06:45:48,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:45:48,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 06:45:48,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054543263] [2019-11-20 06:45:48,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:48,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:45:48,241 INFO L87 Difference]: Start difference. First operand 7863 states and 8363 transitions. Second operand 3 states. [2019-11-20 06:45:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:49,205 INFO L93 Difference]: Finished difference Result 15725 states and 16726 transitions. [2019-11-20 06:45:49,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:45:49,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 676 [2019-11-20 06:45:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:49,217 INFO L225 Difference]: With dead ends: 15725 [2019-11-20 06:45:49,217 INFO L226 Difference]: Without dead ends: 7864 [2019-11-20 06:45:49,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 677 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:45:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7864 states. [2019-11-20 06:45:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7864 to 7861. [2019-11-20 06:45:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2019-11-20 06:45:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 8288 transitions. [2019-11-20 06:45:49,313 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 8288 transitions. Word has length 676 [2019-11-20 06:45:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:49,314 INFO L462 AbstractCegarLoop]: Abstraction has 7861 states and 8288 transitions. [2019-11-20 06:45:49,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:45:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 8288 transitions. [2019-11-20 06:45:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-20 06:45:49,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:49,326 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 06:45:49,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:45:49,538 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1189188974, now seen corresponding path program 1 times [2019-11-20 06:45:49,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:49,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127455926] [2019-11-20 06:45:49,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 06:45:50,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127455926] [2019-11-20 06:45:50,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:50,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:45:50,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735850021] [2019-11-20 06:45:50,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:50,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:50,174 INFO L87 Difference]: Start difference. First operand 7861 states and 8288 transitions. Second operand 4 states. [2019-11-20 06:45:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:51,423 INFO L93 Difference]: Finished difference Result 16276 states and 17083 transitions. [2019-11-20 06:45:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:51,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2019-11-20 06:45:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:51,435 INFO L225 Difference]: With dead ends: 16276 [2019-11-20 06:45:51,435 INFO L226 Difference]: Without dead ends: 7819 [2019-11-20 06:45:51,440 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 06:45:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-11-20 06:45:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 6320. [2019-11-20 06:45:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2019-11-20 06:45:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 6499 transitions. [2019-11-20 06:45:51,517 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 6499 transitions. Word has length 691 [2019-11-20 06:45:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:51,518 INFO L462 AbstractCegarLoop]: Abstraction has 6320 states and 6499 transitions. [2019-11-20 06:45:51,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 6499 transitions. [2019-11-20 06:45:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-11-20 06:45:51,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:51,528 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:51,529 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2083360250, now seen corresponding path program 1 times [2019-11-20 06:45:51,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:51,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445627284] [2019-11-20 06:45:51,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 85 proven. 804 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:52,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445627284] [2019-11-20 06:45:52,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615955088] [2019-11-20 06:45:52,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/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 06:45:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:52,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:45:52,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:45:52,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:52,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:52,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:52,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:52,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:52,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:52,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:45:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-20 06:45:53,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:45:53,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-20 06:45:53,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836596289] [2019-11-20 06:45:53,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:53,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:45:53,931 INFO L87 Difference]: Start difference. First operand 6320 states and 6499 transitions. Second operand 3 states. [2019-11-20 06:46:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,234 INFO L93 Difference]: Finished difference Result 15043 states and 15511 transitions. [2019-11-20 06:46:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:09,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 698 [2019-11-20 06:46:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,245 INFO L225 Difference]: With dead ends: 15043 [2019-11-20 06:46:09,245 INFO L226 Difference]: Without dead ends: 8725 [2019-11-20 06:46:09,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:46:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2019-11-20 06:46:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 8120. [2019-11-20 06:46:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8120 states. [2019-11-20 06:46:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8120 states to 8120 states and 8371 transitions. [2019-11-20 06:46:09,327 INFO L78 Accepts]: Start accepts. Automaton has 8120 states and 8371 transitions. Word has length 698 [2019-11-20 06:46:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,328 INFO L462 AbstractCegarLoop]: Abstraction has 8120 states and 8371 transitions. [2019-11-20 06:46:09,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8120 states and 8371 transitions. [2019-11-20 06:46:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2019-11-20 06:46:09,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,345 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:09,549 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,549 INFO L82 PathProgramCache]: Analyzing trace with hash -384171549, now seen corresponding path program 1 times [2019-11-20 06:46:09,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979644120] [2019-11-20 06:46:09,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-20 06:46:10,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979644120] [2019-11-20 06:46:10,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:10,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:10,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021037985] [2019-11-20 06:46:10,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:10,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:10,492 INFO L87 Difference]: Start difference. First operand 8120 states and 8371 transitions. Second operand 3 states. [2019-11-20 06:46:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:11,410 INFO L93 Difference]: Finished difference Result 19526 states and 20169 transitions. [2019-11-20 06:46:11,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:11,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 908 [2019-11-20 06:46:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:11,421 INFO L225 Difference]: With dead ends: 19526 [2019-11-20 06:46:11,422 INFO L226 Difference]: Without dead ends: 11707 [2019-11-20 06:46:11,428 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 06:46:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11707 states. [2019-11-20 06:46:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11707 to 10212. [2019-11-20 06:46:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10212 states. [2019-11-20 06:46:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10212 states to 10212 states and 10499 transitions. [2019-11-20 06:46:11,535 INFO L78 Accepts]: Start accepts. Automaton has 10212 states and 10499 transitions. Word has length 908 [2019-11-20 06:46:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:11,536 INFO L462 AbstractCegarLoop]: Abstraction has 10212 states and 10499 transitions. [2019-11-20 06:46:11,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10212 states and 10499 transitions. [2019-11-20 06:46:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-20 06:46:11,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:11,555 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:11,555 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1617243607, now seen corresponding path program 1 times [2019-11-20 06:46:11,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:11,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143331148] [2019-11-20 06:46:11,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 838 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-20 06:46:12,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143331148] [2019-11-20 06:46:12,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:12,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:12,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101500654] [2019-11-20 06:46:12,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:12,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:12,387 INFO L87 Difference]: Start difference. First operand 10212 states and 10499 transitions. Second operand 3 states. [2019-11-20 06:46:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:13,360 INFO L93 Difference]: Finished difference Result 22819 states and 23483 transitions. [2019-11-20 06:46:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:13,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 922 [2019-11-20 06:46:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:13,377 INFO L225 Difference]: With dead ends: 22819 [2019-11-20 06:46:13,377 INFO L226 Difference]: Without dead ends: 12908 [2019-11-20 06:46:13,382 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 06:46:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12908 states. [2019-11-20 06:46:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12908 to 12303. [2019-11-20 06:46:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-11-20 06:46:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 12652 transitions. [2019-11-20 06:46:13,506 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 12652 transitions. Word has length 922 [2019-11-20 06:46:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:13,507 INFO L462 AbstractCegarLoop]: Abstraction has 12303 states and 12652 transitions. [2019-11-20 06:46:13,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 12652 transitions. [2019-11-20 06:46:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-20 06:46:13,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:13,523 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:13,524 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1236328096, now seen corresponding path program 1 times [2019-11-20 06:46:13,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:13,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900253497] [2019-11-20 06:46:13,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 77 proven. 1322 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-20 06:46:16,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900253497] [2019-11-20 06:46:16,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397757890] [2019-11-20 06:46:16,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:16,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:46:16,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 64 proven. 897 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-20 06:46:17,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:46:17,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-20 06:46:17,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420370301] [2019-11-20 06:46:17,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 06:46:17,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:17,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 06:46:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 06:46:17,778 INFO L87 Difference]: Start difference. First operand 12303 states and 12652 transitions. Second operand 11 states. [2019-11-20 06:46:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:25,035 INFO L93 Difference]: Finished difference Result 47712 states and 49202 transitions. [2019-11-20 06:46:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 06:46:25,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1043 [2019-11-20 06:46:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:25,059 INFO L225 Difference]: With dead ends: 47712 [2019-11-20 06:46:25,059 INFO L226 Difference]: Without dead ends: 35710 [2019-11-20 06:46:25,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-11-20 06:46:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35710 states. [2019-11-20 06:46:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35710 to 21291. [2019-11-20 06:46:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21291 states. [2019-11-20 06:46:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21291 states to 21291 states and 21929 transitions. [2019-11-20 06:46:25,410 INFO L78 Accepts]: Start accepts. Automaton has 21291 states and 21929 transitions. Word has length 1043 [2019-11-20 06:46:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:25,411 INFO L462 AbstractCegarLoop]: Abstraction has 21291 states and 21929 transitions. [2019-11-20 06:46:25,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 06:46:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21291 states and 21929 transitions. [2019-11-20 06:46:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1697 [2019-11-20 06:46:25,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:25,465 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:25,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:25,668 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1576812717, now seen corresponding path program 1 times [2019-11-20 06:46:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:25,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508920100] [2019-11-20 06:46:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4776 backedges. 2598 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2019-11-20 06:46:27,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508920100] [2019-11-20 06:46:27,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:27,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:27,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122591903] [2019-11-20 06:46:27,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:27,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:27,922 INFO L87 Difference]: Start difference. First operand 21291 states and 21929 transitions. Second operand 3 states. [2019-11-20 06:46:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:28,840 INFO L93 Difference]: Finished difference Result 39884 states and 41102 transitions. [2019-11-20 06:46:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:28,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1696 [2019-11-20 06:46:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:28,859 INFO L225 Difference]: With dead ends: 39884 [2019-11-20 06:46:28,859 INFO L226 Difference]: Without dead ends: 21589 [2019-11-20 06:46:28,870 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 06:46:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21589 states. [2019-11-20 06:46:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21589 to 21290. [2019-11-20 06:46:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21290 states. [2019-11-20 06:46:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21290 states to 21290 states and 21927 transitions. [2019-11-20 06:46:29,078 INFO L78 Accepts]: Start accepts. Automaton has 21290 states and 21927 transitions. Word has length 1696 [2019-11-20 06:46:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:29,079 INFO L462 AbstractCegarLoop]: Abstraction has 21290 states and 21927 transitions. [2019-11-20 06:46:29,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21290 states and 21927 transitions. [2019-11-20 06:46:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2073 [2019-11-20 06:46:29,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:29,111 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:29,111 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:29,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1956119995, now seen corresponding path program 1 times [2019-11-20 06:46:29,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:29,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740247481] [2019-11-20 06:46:29,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7195 backedges. 3635 proven. 0 refuted. 0 times theorem prover too weak. 3560 trivial. 0 not checked. [2019-11-20 06:46:31,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740247481] [2019-11-20 06:46:31,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:31,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:46:31,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55287816] [2019-11-20 06:46:31,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:31,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:31,976 INFO L87 Difference]: Start difference. First operand 21290 states and 21927 transitions. Second operand 4 states. [2019-11-20 06:46:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:33,556 INFO L93 Difference]: Finished difference Result 41680 states and 42931 transitions. [2019-11-20 06:46:33,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:33,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2072 [2019-11-20 06:46:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:33,579 INFO L225 Difference]: With dead ends: 41680 [2019-11-20 06:46:33,579 INFO L226 Difference]: Without dead ends: 20990 [2019-11-20 06:46:33,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20990 states. [2019-11-20 06:46:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20990 to 16796. [2019-11-20 06:46:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16796 states. [2019-11-20 06:46:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16796 states to 16796 states and 17146 transitions. [2019-11-20 06:46:33,778 INFO L78 Accepts]: Start accepts. Automaton has 16796 states and 17146 transitions. Word has length 2072 [2019-11-20 06:46:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:33,779 INFO L462 AbstractCegarLoop]: Abstraction has 16796 states and 17146 transitions. [2019-11-20 06:46:33,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 16796 states and 17146 transitions. [2019-11-20 06:46:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2225 [2019-11-20 06:46:33,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:33,828 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:33,828 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1095182389, now seen corresponding path program 1 times [2019-11-20 06:46:33,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:33,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349578084] [2019-11-20 06:46:33,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 5753 proven. 1802 refuted. 0 times theorem prover too weak. 1654 trivial. 0 not checked. [2019-11-20 06:46:40,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349578084] [2019-11-20 06:46:40,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684074726] [2019-11-20 06:46:40,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:40,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 06:46:40,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:40,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 06:46:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 6292 proven. 152 refuted. 0 times theorem prover too weak. 2765 trivial. 0 not checked. [2019-11-20 06:46:44,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:46:44,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-11-20 06:46:44,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728907516] [2019-11-20 06:46:44,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 06:46:44,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 06:46:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-20 06:46:44,703 INFO L87 Difference]: Start difference. First operand 16796 states and 17146 transitions. Second operand 15 states. [2019-11-20 06:47:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:01,295 INFO L93 Difference]: Finished difference Result 40329 states and 41183 transitions. [2019-11-20 06:47:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-20 06:47:01,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2224 [2019-11-20 06:47:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:01,296 INFO L225 Difference]: With dead ends: 40329 [2019-11-20 06:47:01,296 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:47:01,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2313 GetRequests, 2256 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 06:47:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:47:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:47:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:47:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:47:01,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2224 [2019-11-20 06:47:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:01,307 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:47:01,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 06:47:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:47:01,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:47:01,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:47:01,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:47:02,648 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 519 DAG size of output: 444 [2019-11-20 06:47:03,399 WARN L191 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 519 DAG size of output: 444 [2019-11-20 06:47:03,827 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 473 DAG size of output: 414 [2019-11-20 06:47:07,450 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 431 DAG size of output: 153 [2019-11-20 06:47:10,888 WARN L191 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 431 DAG size of output: 153 [2019-11-20 06:47:13,295 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 401 DAG size of output: 154 [2019-11-20 06:47:13,298 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,298 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,299 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,300 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,301 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,302 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 06:47:13,303 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,304 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,305 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,306 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,307 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,308 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,309 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 06:47:13,310 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,311 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 06:47:13,312 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,313 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse33 (+ ~a4~0 86)) (.cse32 (+ ~a0~0 61))) (let ((.cse30 (< 0 .cse32)) (.cse5 (<= .cse33 0))) (let ((.cse15 (+ ~a0~0 44)) (.cse16 (<= (* 10 ~a29~0) (+ (* 9 ~a0~0) 806))) (.cse28 (<= ~a29~0 43)) (.cse3 (= 4 ~a2~0)) (.cse29 (exists ((v_prenex_1 Int)) (let ((.cse36 (* v_prenex_1 9))) (let ((.cse34 (+ (div .cse36 10) 1))) (let ((.cse35 (mod .cse34 29))) (and (< .cse34 0) (<= .cse35 (+ ~a29~0 15)) (not (= (mod .cse36 10) 0)) (not (= 0 .cse35)) (< (* 9 v_prenex_1) 0))))))) (.cse24 (<= (+ ~a0~0 98) 0)) (.cse17 (= ~a2~0 1)) (.cse8 (< 0 .cse33)) (.cse27 (or .cse30 .cse5)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse22 (= 3 ~a2~0))) (let ((.cse10 (< 0 (+ ~a0~0 147))) (.cse9 (and .cse27 .cse0 .cse22)) (.cse19 (<= 2 ~a2~0)) (.cse20 (<= ~a2~0 2)) (.cse7 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse6 (<= ~a29~0 41)) (.cse11 (and .cse24 .cse0 .cse17 .cse8)) (.cse25 (<= 0 (+ ~a0~0 595421))) (.cse12 (and .cse5 (or .cse16 .cse28) .cse3 .cse29)) (.cse26 (<= (+ ~a29~0 16) 0)) (.cse18 (< 0 (+ ~a29~0 144))) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse2 (<= 0 (+ ~a0~0 595423))) (.cse23 (<= .cse32 0)) (.cse13 (let ((.cse31 (not (= ~a2~0 3)))) (or (and .cse5 .cse30 .cse31) (and .cse5 (not (= 2 ~a2~0)) .cse31)))) (.cse21 (<= 0 .cse15)) (.cse14 (= 5 ~a2~0)) (.cse4 (< 43 ~a29~0))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 (<= 4696 ~a0~0) .cse6 .cse3) (and .cse7 (or .cse8 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse9) (and .cse10 .cse11) (and .cse6 .cse12) (and .cse6 (and .cse13 .cse14)) (and .cse0 .cse1 .cse10 .cse3) (and (= 0 .cse15) .cse16 (and .cse5 .cse17 .cse18)) (and .cse19 .cse20 .cse21 .cse13) (and .cse0 .cse1 .cse22 .cse4) (and .cse13 .cse23) (and .cse5 .cse24) (and .cse6 .cse0 .cse1 .cse25 .cse3) (and .cse6 (and .cse9 .cse21)) (and .cse14 (and .cse2 (and .cse24 .cse0))) (and .cse0 .cse1 .cse26 .cse18 .cse22) (and (and .cse19 .cse24 .cse0 .cse20) .cse2) (and .cse7 (and .cse0 .cse1 .cse22)) (and .cse27 .cse22 .cse23) (and .cse6 (and .cse0 (and .cse17 .cse8 .cse18) .cse2)) (and (and .cse0 .cse21 .cse22) .cse4) (and .cse11 .cse25 .cse4) (and .cse12 .cse28 (<= 0 (+ ~a0~0 54))) (and .cse5 .cse26 .cse18 .cse3) (and .cse0 .cse1 .cse2 .cse22) (and .cse5 .cse23 .cse29) (and (and .cse13 .cse21) .cse14 .cse4)))))) [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,314 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,315 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,316 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,317 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,317 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse38 (+ ~a4~0 86)) (.cse32 (+ ~a0~0 61))) (let ((.cse33 (< 0 .cse32)) (.cse14 (<= .cse38 0))) (let ((.cse6 (+ ~a29~0 144)) (.cse15 (<= (+ ~a0~0 98) 0)) (.cse31 (< 0 .cse38)) (.cse26 (+ ~a0~0 44)) (.cse29 (or .cse33 .cse14)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse13 (= 3 ~a2~0)) (.cse30 (= ~a2~0 1)) (.cse27 (<= (* 10 ~a29~0) (+ (* 9 ~a0~0) 806))) (.cse18 (<= ~a29~0 43)) (.cse3 (= 4 ~a2~0)) (.cse24 (exists ((v_prenex_1 Int)) (let ((.cse37 (* v_prenex_1 9))) (let ((.cse35 (+ (div .cse37 10) 1))) (let ((.cse36 (mod .cse35 29))) (and (< .cse35 0) (<= .cse36 (+ ~a29~0 15)) (not (= (mod .cse37 10) 0)) (not (= 0 .cse36)) (< (* 9 v_prenex_1) 0)))))))) (let ((.cse9 (<= 2 ~a2~0)) (.cse10 (<= ~a2~0 2)) (.cse17 (and .cse14 (or .cse27 .cse18) .cse3 .cse24)) (.cse16 (= 5 ~a2~0)) (.cse7 (< 0 (+ ~a0~0 147))) (.cse5 (and .cse14 .cse30)) (.cse12 (let ((.cse34 (not (= ~a2~0 3)))) (or (and .cse14 .cse33 .cse34) (and .cse14 (not (= 2 ~a2~0)) .cse34)))) (.cse22 (and .cse29 .cse0 .cse13)) (.cse11 (<= 0 .cse26)) (.cse21 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse23 (<= .cse32 0)) (.cse25 (<= ~a29~0 41)) (.cse8 (and .cse15 .cse0 .cse30 .cse31)) (.cse28 (<= 0 (+ ~a0~0 595421))) (.cse4 (< 43 ~a29~0)) (.cse2 (<= 0 (+ ~a0~0 595423))) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse19 (<= (+ ~a29~0 16) 0)) (.cse20 (< 0 .cse6))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 (<= .cse6 0)) (and .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse4) (and .cse14 .cse15) (and .cse16 (and .cse2 (and .cse15 .cse0))) (and (and .cse9 .cse15 .cse0 .cse10) .cse2) (and (and .cse0 .cse11 .cse13) .cse4) (and .cse17 .cse18 (<= 0 (+ ~a0~0 54))) (and .cse14 (and .cse19 .cse20) .cse3) (and .cse21 .cse22) (and .cse14 .cse23 .cse24) (and (and .cse12 .cse11) .cse16 .cse4) (and .cse14 (<= 4696 ~a0~0) .cse25 .cse3) (and .cse25 .cse17) (and .cse25 (and .cse12 .cse16)) (and .cse0 .cse1 .cse7 .cse3) (and (= 0 .cse26) .cse27 .cse5) (and .cse12 .cse23) (and .cse25 .cse0 .cse1 .cse28 .cse3) (and .cse25 (and .cse22 .cse11)) (and .cse21 (and .cse0 .cse1 .cse13)) (and .cse29 .cse13 .cse23) (and .cse25 (and .cse0 (and .cse30 .cse31 .cse20) .cse2)) (and .cse8 .cse28 .cse4) (and .cse0 .cse1 .cse2 .cse13) (and .cse0 .cse1 .cse19 .cse20 .cse13)))))) [2019-11-20 06:47:13,317 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,317 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 06:47:13,317 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 06:47:13,318 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,319 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,320 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 06:47:13,321 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,322 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse38 (+ ~a4~0 86)) (.cse32 (+ ~a0~0 61))) (let ((.cse33 (< 0 .cse32)) (.cse14 (<= .cse38 0))) (let ((.cse6 (+ ~a29~0 144)) (.cse15 (<= (+ ~a0~0 98) 0)) (.cse31 (< 0 .cse38)) (.cse26 (+ ~a0~0 44)) (.cse29 (or .cse33 .cse14)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse13 (= 3 ~a2~0)) (.cse30 (= ~a2~0 1)) (.cse27 (<= (* 10 ~a29~0) (+ (* 9 ~a0~0) 806))) (.cse18 (<= ~a29~0 43)) (.cse3 (= 4 ~a2~0)) (.cse24 (exists ((v_prenex_1 Int)) (let ((.cse37 (* v_prenex_1 9))) (let ((.cse35 (+ (div .cse37 10) 1))) (let ((.cse36 (mod .cse35 29))) (and (< .cse35 0) (<= .cse36 (+ ~a29~0 15)) (not (= (mod .cse37 10) 0)) (not (= 0 .cse36)) (< (* 9 v_prenex_1) 0)))))))) (let ((.cse9 (<= 2 ~a2~0)) (.cse10 (<= ~a2~0 2)) (.cse17 (and .cse14 (or .cse27 .cse18) .cse3 .cse24)) (.cse16 (= 5 ~a2~0)) (.cse7 (< 0 (+ ~a0~0 147))) (.cse5 (and .cse14 .cse30)) (.cse12 (let ((.cse34 (not (= ~a2~0 3)))) (or (and .cse14 .cse33 .cse34) (and .cse14 (not (= 2 ~a2~0)) .cse34)))) (.cse22 (and .cse29 .cse0 .cse13)) (.cse11 (<= 0 .cse26)) (.cse21 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse23 (<= .cse32 0)) (.cse25 (<= ~a29~0 41)) (.cse8 (and .cse15 .cse0 .cse30 .cse31)) (.cse28 (<= 0 (+ ~a0~0 595421))) (.cse4 (< 43 ~a29~0)) (.cse2 (<= 0 (+ ~a0~0 595423))) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse19 (<= (+ ~a29~0 16) 0)) (.cse20 (< 0 .cse6))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 (<= .cse6 0)) (and .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse4) (and .cse14 .cse15) (and .cse16 (and .cse2 (and .cse15 .cse0))) (and (and .cse9 .cse15 .cse0 .cse10) .cse2) (and (and .cse0 .cse11 .cse13) .cse4) (and .cse17 .cse18 (<= 0 (+ ~a0~0 54))) (and .cse14 (and .cse19 .cse20) .cse3) (and .cse21 .cse22) (and .cse14 .cse23 .cse24) (and (and .cse12 .cse11) .cse16 .cse4) (and .cse14 (<= 4696 ~a0~0) .cse25 .cse3) (and .cse25 .cse17) (and .cse25 (and .cse12 .cse16)) (and .cse0 .cse1 .cse7 .cse3) (and (= 0 .cse26) .cse27 .cse5) (and .cse12 .cse23) (and .cse25 .cse0 .cse1 .cse28 .cse3) (and .cse25 (and .cse22 .cse11)) (and .cse21 (and .cse0 .cse1 .cse13)) (and .cse29 .cse13 .cse23) (and .cse25 (and .cse0 (and .cse30 .cse31 .cse20) .cse2)) (and .cse8 .cse28 .cse4) (and .cse0 .cse1 .cse2 .cse13) (and .cse0 .cse1 .cse19 .cse20 .cse13)))))) [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,323 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,324 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,325 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,326 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,327 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,328 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 06:47:13,329 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 06:47:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:47:13 BoogieIcfgContainer [2019-11-20 06:47:13,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:47:13,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:47:13,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:47:13,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:47:13,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:05" (3/4) ... [2019-11-20 06:47:13,443 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 06:47:13,494 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 06:47:13,497 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 06:47:13,547 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (0 < a0 + 147 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86)) || (((2 <= a2 && a2 <= 2) && 0 <= a0 + 44) && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || (5 == a2 && 0 <= a0 + 595423 && a0 + 98 <= 0 && a4 + 42 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0)) && a29 <= 43) && 0 <= a0 + 54)) || ((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 4 == a2)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && ((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 41) && 4 == a2)) || (a29 <= 41 && ((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (a29 <= 41 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 5 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2)) || ((0 == a0 + 44 && 10 * a29 <= 9 * a0 + 806) && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && a0 + 61 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a29 <= 41 && (((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) && 0 <= a0 + 44)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((0 < a0 + 61 || a4 + 86 <= 0) && 3 == a2) && a0 + 61 <= 0)) || (a29 <= 41 && (a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 595423)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 <= a0 + 595421) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) [2019-11-20 06:47:13,552 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (0 < a0 + 147 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86)) || (((2 <= a2 && a2 <= 2) && 0 <= a0 + 44) && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || (5 == a2 && 0 <= a0 + 595423 && a0 + 98 <= 0 && a4 + 42 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0)) && a29 <= 43) && 0 <= a0 + 54)) || ((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 4 == a2)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && ((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 41) && 4 == a2)) || (a29 <= 41 && ((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (a29 <= 41 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 5 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2)) || ((0 == a0 + 44 && 10 * a29 <= 9 * a0 + 806) && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && a0 + 61 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a29 <= 41 && (((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) && 0 <= a0 + 44)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((0 < a0 + 61 || a4 + 86 <= 0) && 3 == a2) && a0 + 61 <= 0)) || (a29 <= 41 && (a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 595423)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 <= a0 + 595421) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) [2019-11-20 06:47:13,567 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 41) && 4 == a2)) || (((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (0 < a4 + 86 || !(1 == input))) && ((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2)) || (0 < a0 + 147 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86)) || (a29 <= 41 && ((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (a29 <= 41 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 5 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2)) || ((0 == a0 + 44 && 10 * a29 <= 9 * a0 + 806) && (a4 + 86 <= 0 && a2 == 1) && 0 < a29 + 144)) || (((2 <= a2 && a2 <= 2) && 0 <= a0 + 44) && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && a0 + 61 <= 0)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a29 <= 41 && (((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) && 0 <= a0 + 44)) || (5 == a2 && 0 <= a0 + 595423 && a0 + 98 <= 0 && a4 + 42 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((0 < a0 + 61 || a4 + 86 <= 0) && 3 == a2) && a0 + 61 <= 0)) || (a29 <= 41 && (a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0)) && a29 <= 43) && 0 <= a0 + 54)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29) [2019-11-20 06:47:13,764 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0e07d643-20e3-4482-b716-b4e3ea8ff941/bin/uautomizer/witness.graphml [2019-11-20 06:47:13,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:47:13,766 INFO L168 Benchmark]: Toolchain (without parser) took 133341.74 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 944.7 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,766 INFO L168 Benchmark]: CDTParser took 0.22 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 06:47:13,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1176.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 216.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,767 INFO L168 Benchmark]: Boogie Preprocessor took 154.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,767 INFO L168 Benchmark]: RCFGBuilder took 3183.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 945.5 MB in the end (delta: 78.0 MB). Peak memory consumption was 165.8 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,768 INFO L168 Benchmark]: TraceAbstraction took 128271.49 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 940.3 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,768 INFO L168 Benchmark]: Witness Printer took 332.37 ms. Allocated memory is still 5.0 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:13,770 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.22 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 1176.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 216.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 154.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3183.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 945.5 MB in the end (delta: 78.0 MB). Peak memory consumption was 165.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128271.49 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 940.3 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 332.37 ms. Allocated memory is still 5.0 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 205]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-11-20 06:47:13,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (0 < a0 + 147 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86)) || (((2 <= a2 && a2 <= 2) && 0 <= a0 + 44) && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || (5 == a2 && 0 <= a0 + 595423 && a0 + 98 <= 0 && a4 + 42 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0)) && a29 <= 43) && 0 <= a0 + 54)) || ((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 4 == a2)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && ((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 41) && 4 == a2)) || (a29 <= 41 && ((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (a29 <= 41 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 5 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2)) || ((0 == a0 + 44 && 10 * a29 <= 9 * a0 + 806) && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && a0 + 61 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a29 <= 41 && (((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) && 0 <= a0 + 44)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((0 < a0 + 61 || a4 + 86 <= 0) && 3 == a2) && a0 + 61 <= 0)) || (a29 <= 41 && (a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 595423)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 <= a0 + 595421) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 06:47:13,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (0 < a0 + 147 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86)) || (((2 <= a2 && a2 <= 2) && 0 <= a0 + 44) && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || (5 == a2 && 0 <= a0 + 595423 && a0 + 98 <= 0 && a4 + 42 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0)) && a29 <= 43) && 0 <= a0 + 54)) || ((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 4 == a2)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && ((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 41) && 4 == a2)) || (a29 <= 41 && ((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (a29 <= 41 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 5 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2)) || ((0 == a0 + 44 && 10 * a29 <= 9 * a0 + 806) && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && a0 + 61 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a29 <= 41 && (((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) && 0 <= a0 + 44)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((0 < a0 + 61 || a4 + 86 <= 0) && 3 == a2) && a0 + 61 <= 0)) || (a29 <= 41 && (a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 595423)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 <= a0 + 595421) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 06:47:13,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 06:47:13,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 06:47:13,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 41) && 4 == a2)) || (((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (0 < a4 + 86 || !(1 == input))) && ((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2)) || (0 < a0 + 147 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86)) || (a29 <= 41 && ((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (a29 <= 41 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 5 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2)) || ((0 == a0 + 44 && 10 * a29 <= 9 * a0 + 806) && (a4 + 86 <= 0 && a2 == 1) && 0 < a29 + 144)) || (((2 <= a2 && a2 <= 2) && 0 <= a0 + 44) && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && a0 + 61 <= 0)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a29 <= 41 && (((0 < a0 + 61 || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) && 0 <= a0 + 44)) || (5 == a2 && 0 <= a0 + 595423 && a0 + 98 <= 0 && a4 + 42 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && (a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((0 < a0 + 61 || a4 + 86 <= 0) && 3 == a2) && a0 + 61 <= 0)) || (a29 <= 41 && (a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0)) && a29 <= 43) && 0 <= a0 + 54)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(a2 == 3))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 128.0s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 77.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.7s, HoareTripleCheckerStatistics: 4783 SDtfs, 20713 SDslu, 1331 SDs, 0 SdLazy, 55463 SolverSat, 5617 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 64.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6120 GetRequests, 5961 SyntacticMatches, 20 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21291occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 30025 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 396 NumberOfFragments, 2532 HoareAnnotationTreeSize, 4 FomulaSimplifications, 79713 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 141632 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 20821 NumberOfCodeBlocks, 20821 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 20794 ConstructedInterpolants, 129 QuantifiedInterpolants, 68539115 SizeOfPredicates, 12 NumberOfNonLiveVariables, 6893 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 40135/45428 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...