./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --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_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/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 4fc86a08ff37d05adddb13279399a852f6ece83c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:04:13,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:04:13,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:04:13,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:04:13,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:04:13,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:04:13,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:04:13,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:04:13,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:04:13,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:04:13,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:04:13,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:04:13,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:04:13,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:04:13,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:04:13,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:04:13,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:04:13,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:04:13,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:04:13,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:04:13,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:04:13,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:04:13,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:04:13,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:04:13,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:04:13,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:04:13,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:04:13,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:04:13,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:04:13,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:04:13,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:04:13,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:04:13,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:04:13,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:04:13,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:04:13,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:04:13,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:04:13,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:04:13,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:04:13,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:04:13,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:04:13,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:04:13,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:04:13,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:04:13,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:04:13,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:04:13,734 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:04:13,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:04:13,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:04:13,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:04:13,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:04:13,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:04:13,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:04:13,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:04:13,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:04:13,736 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:04:13,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:04:13,737 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:04:13,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:04:13,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:04:13,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:04:13,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:04:13,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:04:13,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:04:13,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:04:13,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:04:13,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:04:13,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:04:13,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:04:13,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:04:13,740 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_8aa9191a-d402-4ffa-92ea-03c26e9236d7/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 -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2019-11-19 22:04:13,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:04:13,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:04:13,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:04:13,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:04:13,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:04:13,944 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-19 22:04:14,020 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/data/fc5bcf25d/86d06f03c24d4dbe816a2126e9814567/FLAG1dde51798 [2019-11-19 22:04:14,449 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:04:14,450 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-19 22:04:14,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/data/fc5bcf25d/86d06f03c24d4dbe816a2126e9814567/FLAG1dde51798 [2019-11-19 22:04:14,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/data/fc5bcf25d/86d06f03c24d4dbe816a2126e9814567 [2019-11-19 22:04:14,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:04:14,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:04:14,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:04:14,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:04:14,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:04:14,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:14" (1/1) ... [2019-11-19 22:04:14,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b3ca57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:14, skipping insertion in model container [2019-11-19 22:04:14,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:14" (1/1) ... [2019-11-19 22:04:14,826 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:04:14,848 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:04:15,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:04:15,027 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:04:15,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:04:15,156 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:04:15,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15 WrapperNode [2019-11-19 22:04:15,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:04:15,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:04:15,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:04:15,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:04:15,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:04:15,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:04:15,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:04:15,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:04:15,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2019-11-19 22:04:15,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:04:15,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:04:15,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:04:15,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:04:15,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:04:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:04:15,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:04:15,819 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:04:15,819 INFO L285 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-19 22:04:15,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:15 BoogieIcfgContainer [2019-11-19 22:04:15,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:04:15,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:04:15,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:04:15,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:04:15,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:14" (1/3) ... [2019-11-19 22:04:15,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ae391b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:15, skipping insertion in model container [2019-11-19 22:04:15,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (2/3) ... [2019-11-19 22:04:15,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ae391b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:15, skipping insertion in model container [2019-11-19 22:04:15,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:15" (3/3) ... [2019-11-19 22:04:15,830 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-11-19 22:04:15,840 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:04:15,846 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-19 22:04:15,857 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-19 22:04:15,885 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:04:15,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:04:15,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:04:15,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:04:15,886 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:04:15,886 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:04:15,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:04:15,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:04:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-19 22:04:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 22:04:15,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:15,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:15,915 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1242509755, now seen corresponding path program 1 times [2019-11-19 22:04:15,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:15,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597829909] [2019-11-19 22:04:15,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:16,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597829909] [2019-11-19 22:04:16,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:16,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:04:16,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688830339] [2019-11-19 22:04:16,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:04:16,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:04:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:04:16,155 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-11-19 22:04:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:16,316 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2019-11-19 22:04:16,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:04:16,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-19 22:04:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:16,335 INFO L225 Difference]: With dead ends: 144 [2019-11-19 22:04:16,336 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 22:04:16,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:04:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 22:04:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-11-19 22:04:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 22:04:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-19 22:04:16,418 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2019-11-19 22:04:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:16,419 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-19 22:04:16,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:04:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-19 22:04:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 22:04:16,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:16,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:16,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1242533587, now seen corresponding path program 1 times [2019-11-19 22:04:16,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:16,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288624178] [2019-11-19 22:04:16,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:16,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288624178] [2019-11-19 22:04:16,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:16,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:04:16,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966115812] [2019-11-19 22:04:16,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:04:16,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:04:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:04:16,525 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2019-11-19 22:04:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:16,707 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-19 22:04:16,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:04:16,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-19 22:04:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:16,711 INFO L225 Difference]: With dead ends: 71 [2019-11-19 22:04:16,711 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 22:04:16,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:04:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 22:04:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2019-11-19 22:04:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 22:04:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-19 22:04:16,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2019-11-19 22:04:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:16,724 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-19 22:04:16,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:04:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-19 22:04:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 22:04:16,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:16,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:16,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1242439254, now seen corresponding path program 1 times [2019-11-19 22:04:16,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:16,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341663707] [2019-11-19 22:04:16,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341663707] [2019-11-19 22:04:16,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:16,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:04:16,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657755554] [2019-11-19 22:04:16,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:04:16,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:16,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:04:16,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:04:16,792 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2019-11-19 22:04:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:17,129 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2019-11-19 22:04:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:04:17,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-19 22:04:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:17,132 INFO L225 Difference]: With dead ends: 127 [2019-11-19 22:04:17,132 INFO L226 Difference]: Without dead ends: 119 [2019-11-19 22:04:17,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:04:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-19 22:04:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2019-11-19 22:04:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 22:04:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-11-19 22:04:17,149 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 8 [2019-11-19 22:04:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:17,149 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-11-19 22:04:17,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:04:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-11-19 22:04:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:04:17,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:17,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:17,151 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash 51126654, now seen corresponding path program 1 times [2019-11-19 22:04:17,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:17,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926661646] [2019-11-19 22:04:17,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:17,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926661646] [2019-11-19 22:04:17,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:17,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:04:17,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619969858] [2019-11-19 22:04:17,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:17,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:04:17,228 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 6 states. [2019-11-19 22:04:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:17,613 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-11-19 22:04:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:04:17,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-19 22:04:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:17,615 INFO L225 Difference]: With dead ends: 155 [2019-11-19 22:04:17,616 INFO L226 Difference]: Without dead ends: 153 [2019-11-19 22:04:17,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:04:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-19 22:04:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2019-11-19 22:04:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-19 22:04:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-11-19 22:04:17,637 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 10 [2019-11-19 22:04:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:17,637 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-11-19 22:04:17,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-11-19 22:04:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:04:17,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:17,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:17,640 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash 74029974, now seen corresponding path program 1 times [2019-11-19 22:04:17,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:17,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231134005] [2019-11-19 22:04:17,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:17,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231134005] [2019-11-19 22:04:17,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:17,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:04:17,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319499653] [2019-11-19 22:04:17,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:04:17,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:17,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:04:17,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:04:17,686 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 4 states. [2019-11-19 22:04:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:17,846 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2019-11-19 22:04:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:04:17,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 22:04:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:17,851 INFO L225 Difference]: With dead ends: 137 [2019-11-19 22:04:17,851 INFO L226 Difference]: Without dead ends: 135 [2019-11-19 22:04:17,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:04:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-19 22:04:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2019-11-19 22:04:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-19 22:04:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2019-11-19 22:04:17,885 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 10 [2019-11-19 22:04:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:17,885 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2019-11-19 22:04:17,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:04:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2019-11-19 22:04:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:04:17,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:17,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:17,888 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash -16628999, now seen corresponding path program 1 times [2019-11-19 22:04:17,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:17,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404245359] [2019-11-19 22:04:17,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:17,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404245359] [2019-11-19 22:04:17,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:17,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:04:17,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504515883] [2019-11-19 22:04:17,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:04:17,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:17,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:04:17,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:04:17,985 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 5 states. [2019-11-19 22:04:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:18,269 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2019-11-19 22:04:18,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:04:18,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-19 22:04:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:18,273 INFO L225 Difference]: With dead ends: 216 [2019-11-19 22:04:18,273 INFO L226 Difference]: Without dead ends: 208 [2019-11-19 22:04:18,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:04:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-19 22:04:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 160. [2019-11-19 22:04:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-19 22:04:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2019-11-19 22:04:18,315 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 10 [2019-11-19 22:04:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:18,317 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2019-11-19 22:04:18,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:04:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2019-11-19 22:04:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:04:18,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:18,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:18,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash -758219972, now seen corresponding path program 1 times [2019-11-19 22:04:18,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:18,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970986781] [2019-11-19 22:04:18,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:18,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970986781] [2019-11-19 22:04:18,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:18,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:04:18,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124589758] [2019-11-19 22:04:18,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:04:18,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:04:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:04:18,383 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand 3 states. [2019-11-19 22:04:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:18,444 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2019-11-19 22:04:18,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:04:18,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-19 22:04:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:18,447 INFO L225 Difference]: With dead ends: 320 [2019-11-19 22:04:18,447 INFO L226 Difference]: Without dead ends: 251 [2019-11-19 22:04:18,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:04:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-19 22:04:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 191. [2019-11-19 22:04:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-19 22:04:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2019-11-19 22:04:18,487 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 10 [2019-11-19 22:04:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:18,487 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2019-11-19 22:04:18,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:04:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2019-11-19 22:04:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:04:18,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:18,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:18,489 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1017268915, now seen corresponding path program 1 times [2019-11-19 22:04:18,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:18,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39784152] [2019-11-19 22:04:18,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:18,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39784152] [2019-11-19 22:04:18,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:18,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:04:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111764255] [2019-11-19 22:04:18,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:04:18,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:04:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:04:18,550 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand 5 states. [2019-11-19 22:04:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:18,829 INFO L93 Difference]: Finished difference Result 287 states and 363 transitions. [2019-11-19 22:04:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:04:18,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 22:04:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:18,833 INFO L225 Difference]: With dead ends: 287 [2019-11-19 22:04:18,833 INFO L226 Difference]: Without dead ends: 283 [2019-11-19 22:04:18,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:04:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-19 22:04:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2019-11-19 22:04:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-19 22:04:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2019-11-19 22:04:18,855 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 11 [2019-11-19 22:04:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:18,856 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2019-11-19 22:04:18,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:04:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2019-11-19 22:04:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:04:18,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:18,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:18,859 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash 173914847, now seen corresponding path program 1 times [2019-11-19 22:04:18,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:18,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565759641] [2019-11-19 22:04:18,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:18,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565759641] [2019-11-19 22:04:18,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:18,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:04:18,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349664564] [2019-11-19 22:04:18,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:04:18,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:04:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:04:18,943 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand 5 states. [2019-11-19 22:04:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:19,151 INFO L93 Difference]: Finished difference Result 302 states and 371 transitions. [2019-11-19 22:04:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:04:19,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-19 22:04:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:19,156 INFO L225 Difference]: With dead ends: 302 [2019-11-19 22:04:19,156 INFO L226 Difference]: Without dead ends: 300 [2019-11-19 22:04:19,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:04:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-19 22:04:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 241. [2019-11-19 22:04:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-19 22:04:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 304 transitions. [2019-11-19 22:04:19,181 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 304 transitions. Word has length 14 [2019-11-19 22:04:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:19,182 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 304 transitions. [2019-11-19 22:04:19,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:04:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2019-11-19 22:04:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:04:19,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:19,187 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:19,187 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1061608090, now seen corresponding path program 1 times [2019-11-19 22:04:19,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:19,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881959804] [2019-11-19 22:04:19,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:19,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881959804] [2019-11-19 22:04:19,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379685333] [2019-11-19 22:04:19,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:19,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:04:19,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:19,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:04:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:19,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:04:19,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-11-19 22:04:19,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920481238] [2019-11-19 22:04:19,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:19,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:04:19,436 INFO L87 Difference]: Start difference. First operand 241 states and 304 transitions. Second operand 6 states. [2019-11-19 22:04:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:19,667 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2019-11-19 22:04:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:04:19,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-19 22:04:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:19,671 INFO L225 Difference]: With dead ends: 242 [2019-11-19 22:04:19,671 INFO L226 Difference]: Without dead ends: 234 [2019-11-19 22:04:19,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:04:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-19 22:04:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-11-19 22:04:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-19 22:04:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2019-11-19 22:04:19,708 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 15 [2019-11-19 22:04:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:19,708 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2019-11-19 22:04:19,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2019-11-19 22:04:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:04:19,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:19,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:19,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:19,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -371397790, now seen corresponding path program 1 times [2019-11-19 22:04:19,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:19,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196114878] [2019-11-19 22:04:19,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:19,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196114878] [2019-11-19 22:04:19,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:19,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:04:19,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59156325] [2019-11-19 22:04:19,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:19,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:04:19,984 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand 6 states. [2019-11-19 22:04:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:20,321 INFO L93 Difference]: Finished difference Result 446 states and 543 transitions. [2019-11-19 22:04:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:04:20,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 22:04:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:20,326 INFO L225 Difference]: With dead ends: 446 [2019-11-19 22:04:20,326 INFO L226 Difference]: Without dead ends: 444 [2019-11-19 22:04:20,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:04:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-19 22:04:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 368. [2019-11-19 22:04:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-19 22:04:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 456 transitions. [2019-11-19 22:04:20,363 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 456 transitions. Word has length 16 [2019-11-19 22:04:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:20,363 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 456 transitions. [2019-11-19 22:04:20,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 456 transitions. [2019-11-19 22:04:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:04:20,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:20,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:20,366 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1382515040, now seen corresponding path program 1 times [2019-11-19 22:04:20,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:20,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666621900] [2019-11-19 22:04:20,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:20,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666621900] [2019-11-19 22:04:20,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:20,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:04:20,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474363769] [2019-11-19 22:04:20,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:20,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:04:20,437 INFO L87 Difference]: Start difference. First operand 368 states and 456 transitions. Second operand 6 states. [2019-11-19 22:04:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:20,799 INFO L93 Difference]: Finished difference Result 408 states and 495 transitions. [2019-11-19 22:04:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:04:20,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 22:04:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:20,806 INFO L225 Difference]: With dead ends: 408 [2019-11-19 22:04:20,806 INFO L226 Difference]: Without dead ends: 406 [2019-11-19 22:04:20,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:04:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-19 22:04:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 299. [2019-11-19 22:04:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-19 22:04:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 370 transitions. [2019-11-19 22:04:20,840 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 370 transitions. Word has length 16 [2019-11-19 22:04:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:20,843 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 370 transitions. [2019-11-19 22:04:20,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 370 transitions. [2019-11-19 22:04:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:04:20,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:20,844 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] [2019-11-19 22:04:20,844 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1085410132, now seen corresponding path program 1 times [2019-11-19 22:04:20,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:20,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689003395] [2019-11-19 22:04:20,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:20,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689003395] [2019-11-19 22:04:20,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:04:20,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:04:20,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049137777] [2019-11-19 22:04:20,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:20,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:04:20,916 INFO L87 Difference]: Start difference. First operand 299 states and 370 transitions. Second operand 6 states. [2019-11-19 22:04:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:21,257 INFO L93 Difference]: Finished difference Result 439 states and 533 transitions. [2019-11-19 22:04:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:04:21,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-19 22:04:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:21,261 INFO L225 Difference]: With dead ends: 439 [2019-11-19 22:04:21,261 INFO L226 Difference]: Without dead ends: 435 [2019-11-19 22:04:21,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:04:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-19 22:04:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 207. [2019-11-19 22:04:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-19 22:04:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2019-11-19 22:04:21,284 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 20 [2019-11-19 22:04:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:21,285 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2019-11-19 22:04:21,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2019-11-19 22:04:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:04:21,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:21,286 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:21,287 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1447113763, now seen corresponding path program 1 times [2019-11-19 22:04:21,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:21,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815761521] [2019-11-19 22:04:21,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:21,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815761521] [2019-11-19 22:04:21,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210727717] [2019-11-19 22:04:21,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:21,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:04:21,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:21,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:04:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:21,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:04:21,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-11-19 22:04:21,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133015370] [2019-11-19 22:04:21,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:21,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:04:21,517 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand 6 states. [2019-11-19 22:04:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:21,713 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2019-11-19 22:04:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:04:21,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-19 22:04:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:21,716 INFO L225 Difference]: With dead ends: 248 [2019-11-19 22:04:21,716 INFO L226 Difference]: Without dead ends: 246 [2019-11-19 22:04:21,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:04:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-19 22:04:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 109. [2019-11-19 22:04:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-19 22:04:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-11-19 22:04:21,732 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 21 [2019-11-19 22:04:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:21,733 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-11-19 22:04:21,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-11-19 22:04:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:04:21,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:21,735 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:21,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:21,948 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1066677303, now seen corresponding path program 1 times [2019-11-19 22:04:21,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:21,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280799958] [2019-11-19 22:04:21,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:22,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280799958] [2019-11-19 22:04:22,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755614789] [2019-11-19 22:04:22,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:22,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:04:22,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:22,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:04:22,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-11-19 22:04:22,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327977801] [2019-11-19 22:04:22,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:04:22,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:04:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:04:22,213 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 6 states. [2019-11-19 22:04:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:22,516 INFO L93 Difference]: Finished difference Result 399 states and 467 transitions. [2019-11-19 22:04:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:04:22,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-19 22:04:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:22,519 INFO L225 Difference]: With dead ends: 399 [2019-11-19 22:04:22,520 INFO L226 Difference]: Without dead ends: 293 [2019-11-19 22:04:22,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:04:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-19 22:04:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 255. [2019-11-19 22:04:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-19 22:04:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2019-11-19 22:04:22,557 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 30 [2019-11-19 22:04:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:22,558 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2019-11-19 22:04:22,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:04:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2019-11-19 22:04:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 22:04:22,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:22,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:22,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:22,764 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash 478455163, now seen corresponding path program 1 times [2019-11-19 22:04:22,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:22,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101691687] [2019-11-19 22:04:22,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:22,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101691687] [2019-11-19 22:04:22,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121561055] [2019-11-19 22:04:22,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:22,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:04:22,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:23,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:04:23,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-19 22:04:23,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522250007] [2019-11-19 22:04:23,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:04:23,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:04:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:04:23,229 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand 18 states. [2019-11-19 22:04:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:29,785 INFO L93 Difference]: Finished difference Result 936 states and 1063 transitions. [2019-11-19 22:04:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-11-19 22:04:29,785 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-11-19 22:04:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:29,788 INFO L225 Difference]: With dead ends: 936 [2019-11-19 22:04:29,788 INFO L226 Difference]: Without dead ends: 391 [2019-11-19 22:04:29,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1395, Invalid=8307, Unknown=0, NotChecked=0, Total=9702 [2019-11-19 22:04:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-19 22:04:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 152. [2019-11-19 22:04:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-19 22:04:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2019-11-19 22:04:29,821 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 37 [2019-11-19 22:04:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:29,823 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2019-11-19 22:04:29,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 22:04:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2019-11-19 22:04:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 22:04:29,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:29,825 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:30,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:30,033 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:30,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1811445003, now seen corresponding path program 1 times [2019-11-19 22:04:30,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:30,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804138453] [2019-11-19 22:04:30,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:30,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804138453] [2019-11-19 22:04:30,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630019969] [2019-11-19 22:04:30,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:30,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:04:30,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:04:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:30,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:04:30,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 22:04:30,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019279207] [2019-11-19 22:04:30,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:04:30,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:04:30,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:04:30,235 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand 8 states. [2019-11-19 22:04:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:30,649 INFO L93 Difference]: Finished difference Result 176 states and 200 transitions. [2019-11-19 22:04:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:04:30,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-19 22:04:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:30,651 INFO L225 Difference]: With dead ends: 176 [2019-11-19 22:04:30,651 INFO L226 Difference]: Without dead ends: 174 [2019-11-19 22:04:30,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:04:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-19 22:04:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2019-11-19 22:04:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-19 22:04:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2019-11-19 22:04:30,672 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 53 [2019-11-19 22:04:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:30,672 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2019-11-19 22:04:30,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:04:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2019-11-19 22:04:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 22:04:30,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:30,673 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-19 22:04:30,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:30,876 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1337051790, now seen corresponding path program 1 times [2019-11-19 22:04:30,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:30,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19655638] [2019-11-19 22:04:30,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:30,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19655638] [2019-11-19 22:04:30,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800746237] [2019-11-19 22:04:30,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:31,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:04:31,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:31,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:04:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:31,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:04:31,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-11-19 22:04:31,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663544498] [2019-11-19 22:04:31,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:04:31,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:31,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:04:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:04:31,163 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand 13 states. [2019-11-19 22:04:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:32,119 INFO L93 Difference]: Finished difference Result 321 states and 360 transitions. [2019-11-19 22:04:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:04:32,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-11-19 22:04:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:32,123 INFO L225 Difference]: With dead ends: 321 [2019-11-19 22:04:32,123 INFO L226 Difference]: Without dead ends: 319 [2019-11-19 22:04:32,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=736, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 22:04:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-19 22:04:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2019-11-19 22:04:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-19 22:04:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2019-11-19 22:04:32,161 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 55 [2019-11-19 22:04:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:32,163 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2019-11-19 22:04:32,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:04:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2019-11-19 22:04:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 22:04:32,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:32,165 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-19 22:04:32,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:32,373 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash -586176244, now seen corresponding path program 1 times [2019-11-19 22:04:32,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:32,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650048601] [2019-11-19 22:04:32,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:32,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650048601] [2019-11-19 22:04:32,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801161176] [2019-11-19 22:04:32,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:32,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:04:32,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:32,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:04:32,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-19 22:04:32,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988623619] [2019-11-19 22:04:32,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:04:32,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:32,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:04:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:04:32,806 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 18 states. [2019-11-19 22:04:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:41,903 INFO L93 Difference]: Finished difference Result 1647 states and 1835 transitions. [2019-11-19 22:04:41,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-11-19 22:04:41,904 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-19 22:04:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:41,910 INFO L225 Difference]: With dead ends: 1647 [2019-11-19 22:04:41,910 INFO L226 Difference]: Without dead ends: 953 [2019-11-19 22:04:41,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7752 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3202, Invalid=17104, Unknown=0, NotChecked=0, Total=20306 [2019-11-19 22:04:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-11-19 22:04:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 316. [2019-11-19 22:04:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-19 22:04:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 357 transitions. [2019-11-19 22:04:41,987 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 357 transitions. Word has length 55 [2019-11-19 22:04:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:41,987 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 357 transitions. [2019-11-19 22:04:41,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 22:04:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 357 transitions. [2019-11-19 22:04:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-19 22:04:41,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:41,989 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:04:42,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:42,193 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2004720992, now seen corresponding path program 2 times [2019-11-19 22:04:42,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:04:42,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550789141] [2019-11-19 22:04:42,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:04:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:42,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550789141] [2019-11-19 22:04:42,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701911026] [2019-11-19 22:04:42,451 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:42,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:04:42,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:04:42,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:04:42,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:04:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:04:42,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:04:42,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-11-19 22:04:42,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213289177] [2019-11-19 22:04:42,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 22:04:42,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:04:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:04:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:04:42,921 INFO L87 Difference]: Start difference. First operand 316 states and 357 transitions. Second operand 19 states. [2019-11-19 22:04:44,810 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-19 22:04:49,419 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-19 22:04:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:49,614 INFO L93 Difference]: Finished difference Result 764 states and 845 transitions. [2019-11-19 22:04:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-11-19 22:04:49,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2019-11-19 22:04:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:49,621 INFO L225 Difference]: With dead ends: 764 [2019-11-19 22:04:49,621 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:04:49,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2032, Invalid=5978, Unknown=0, NotChecked=0, Total=8010 [2019-11-19 22:04:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:04:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:04:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:04:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:04:49,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2019-11-19 22:04:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:49,626 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:04:49,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 22:04:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:04:49,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:04:49,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:04:49,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:04:51,146 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 376 DAG size of output: 321 [2019-11-19 22:04:52,000 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 285 [2019-11-19 22:04:52,220 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 224 [2019-11-19 22:04:53,014 WARN L191 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 332 [2019-11-19 22:04:53,558 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 309 [2019-11-19 22:04:54,076 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 284 [2019-11-19 22:04:54,196 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 227 [2019-11-19 22:04:54,828 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 314 [2019-11-19 22:04:55,315 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 310 [2019-11-19 22:04:55,639 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 296 [2019-11-19 22:04:55,818 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 226 [2019-11-19 22:04:55,963 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 224 [2019-11-19 22:04:56,621 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 333 [2019-11-19 22:04:56,745 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 227 [2019-11-19 22:04:56,910 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 227 [2019-11-19 22:05:00,315 WARN L191 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 313 DAG size of output: 69 [2019-11-19 22:05:01,843 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 279 DAG size of output: 29 [2019-11-19 22:05:06,916 WARN L191 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 222 DAG size of output: 90 [2019-11-19 22:05:09,690 WARN L191 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 323 DAG size of output: 74 [2019-11-19 22:05:14,845 WARN L191 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 296 DAG size of output: 81 [2019-11-19 22:05:16,274 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 278 DAG size of output: 19 [2019-11-19 22:05:18,495 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 224 DAG size of output: 100 [2019-11-19 22:05:21,600 WARN L191 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 310 DAG size of output: 74 [2019-11-19 22:05:24,513 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 300 DAG size of output: 70 [2019-11-19 22:05:29,340 WARN L191 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 282 DAG size of output: 123 [2019-11-19 22:05:29,991 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 27 [2019-11-19 22:05:33,463 WARN L191 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 222 DAG size of output: 90 [2019-11-19 22:05:35,793 WARN L191 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 329 DAG size of output: 81 [2019-11-19 22:05:38,928 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 224 DAG size of output: 100 [2019-11-19 22:05:39,626 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 25 [2019-11-19 22:05:39,629 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,629 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,629 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:05:39,629 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,630 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_main_~j~0 2)) (.cse12 (* 6 ULTIMATE.start_main_~l~0)) (.cse13 (* 8 ULTIMATE.start_main_~n~0)) (.cse15 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse3 (<= (+ .cse15 2) ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse12) (+ .cse13 (* 3 ULTIMATE.start_main_~j~0)))) (.cse5 (<= .cse15 ULTIMATE.start_main_~r~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse1 (<= 2 ULTIMATE.start_main_~i~0)) (.cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse19 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse19 1)) (<= 1 .cse19))))) (.cse11 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse16 (<= 1 ULTIMATE.start_main_~r~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ .cse18 1))) (.cse7 (<= ULTIMATE.start_main_~j~0 .cse15))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse5)) .cse10 .cse11 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse12 3) .cse13)) (and .cse14 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse2 .cse3 .cse10 .cse11 .cse5)) (and .cse0 .cse7 (<= .cse15 ULTIMATE.start_main_~j~0) .cse9 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse10 .cse14 .cse5 (<= 2 ULTIMATE.start_main_~j~0)) (and (and .cse2 .cse16 .cse17) .cse0 .cse1 .cse10 .cse4 .cse11) (and (and (<= 1 .cse18) .cse8 .cse9 .cse2 .cse10 .cse16 .cse17) .cse6 .cse7)))) [2019-11-19 22:05:39,630 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,630 INFO L440 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse17 (- ULTIMATE.start_main_~r~0)) (.cse4 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse12 (<= 2 ULTIMATE.start_main_~j~0)) (.cse18 (* 6 ULTIMATE.start_main_~l~0)) (.cse19 (* 8 ULTIMATE.start_main_~n~0))) (let ((.cse8 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse18) (+ .cse19 (* 3 ULTIMATE.start_main_~j~0)))) (.cse13 (and .cse4 .cse1 .cse3 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse12)) (.cse16 (<= (div (+ .cse17 (- 1)) (- 2)) (+ (div ULTIMATE.start_main_~j~0 2) 1))) (.cse9 (<= ULTIMATE.start_main_~j~0 .cse10)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse11 (<= 1 ULTIMATE.start_main_~i~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse5 (<= (+ .cse10 2) ULTIMATE.start_main_~n~0)) (.cse14 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse20 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse20 1)) (<= 1 .cse20))))) (.cse7 (<= .cse10 ULTIMATE.start_main_~r~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0)))) (and .cse0 .cse9 (<= .cse10 ULTIMATE.start_main_~j~0) .cse11 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse8 .cse7 .cse12) (and .cse0 .cse13 .cse2 .cse14) (and (and .cse11 .cse13 .cse15) .cse16 .cse9) (and (or (and .cse1 .cse16 .cse9 .cse15 .cse11 .cse7 .cse12) (and .cse0 .cse1 (<= (div .cse17 (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse2 (<= 14 (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~l~0))) .cse4 .cse5 .cse14 .cse7)) (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse18 3) .cse19))))) [2019-11-19 22:05:39,630 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,631 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_main_~j~0 2)) (.cse12 (* 6 ULTIMATE.start_main_~l~0)) (.cse13 (* 8 ULTIMATE.start_main_~n~0)) (.cse15 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse3 (<= (+ .cse15 2) ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse12) (+ .cse13 (* 3 ULTIMATE.start_main_~j~0)))) (.cse5 (<= .cse15 ULTIMATE.start_main_~r~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse1 (<= 2 ULTIMATE.start_main_~i~0)) (.cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse19 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse19 1)) (<= 1 .cse19))))) (.cse11 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse16 (<= 1 ULTIMATE.start_main_~r~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ .cse18 1))) (.cse7 (<= ULTIMATE.start_main_~j~0 .cse15))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse5)) .cse10 .cse11 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse12 3) .cse13)) (and .cse14 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse2 .cse3 .cse10 .cse11 .cse5)) (and .cse0 .cse7 (<= .cse15 ULTIMATE.start_main_~j~0) .cse9 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse10 .cse14 .cse5 (<= 2 ULTIMATE.start_main_~j~0)) (and (and .cse2 .cse16 .cse17) .cse0 .cse1 .cse10 .cse4 .cse11) (and (and (<= 1 .cse18) .cse8 .cse9 .cse2 .cse10 .cse16 .cse17) .cse6 .cse7)))) [2019-11-19 22:05:39,631 INFO L444 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,631 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,631 INFO L440 ceAbstractionStarter]: At program point L4-11(lines 3 8) the Hoare annotation is: (let ((.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse17 (- ULTIMATE.start_main_~r~0)) (.cse4 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse12 (<= 2 ULTIMATE.start_main_~j~0)) (.cse18 (* 6 ULTIMATE.start_main_~l~0)) (.cse19 (* 8 ULTIMATE.start_main_~n~0))) (let ((.cse8 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse18) (+ .cse19 (* 3 ULTIMATE.start_main_~j~0)))) (.cse13 (and .cse4 .cse1 .cse3 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse12)) (.cse16 (<= (div (+ .cse17 (- 1)) (- 2)) (+ (div ULTIMATE.start_main_~j~0 2) 1))) (.cse9 (<= ULTIMATE.start_main_~j~0 .cse10)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse11 (<= 1 ULTIMATE.start_main_~i~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse5 (<= (+ .cse10 2) ULTIMATE.start_main_~n~0)) (.cse14 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse20 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse20 1)) (<= 1 .cse20))))) (.cse7 (<= .cse10 ULTIMATE.start_main_~r~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0)))) (and .cse0 .cse9 (<= .cse10 ULTIMATE.start_main_~j~0) .cse11 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse8 .cse7 .cse12) (and .cse0 .cse13 .cse2 .cse14) (and (and .cse11 .cse13 .cse15) .cse16 .cse9) (and (or (and .cse1 .cse16 .cse9 .cse15 .cse11 .cse7 .cse12) (and .cse0 .cse1 (<= (div .cse17 (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse2 (<= 14 (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~l~0))) .cse4 .cse5 .cse14 .cse7)) (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse18 3) .cse19))))) [2019-11-19 22:05:39,631 INFO L444 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,632 INFO L440 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~l~0)) (.cse14 (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)))) (let ((.cse5 (div ULTIMATE.start_main_~j~0 2)) (.cse4 (<= .cse14 (+ ULTIMATE.start_main_~l~0 1))) (.cse10 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse11 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse8 (<= 1 ULTIMATE.start_main_~l~0)) (.cse13 (<= .cse3 ULTIMATE.start_main_~r~0))) (let ((.cse0 (and (<= .cse14 (+ .cse5 1)) .cse4 .cse10 .cse11 .cse6 .cse7 .cse8 .cse13)) (.cse1 (* 6 ULTIMATE.start_main_~l~0)) (.cse2 (* 8 ULTIMATE.start_main_~n~0)) (.cse9 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse1 3) .cse2)) (and .cse0 (<= ULTIMATE.start_main_~r~0 .cse3)) (and .cse4 (and (<= 1 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_main_~r~0) .cse11 (<= ULTIMATE.start_main_~l~0 1))) (and (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse1) (+ .cse2 (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse12 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))))) (or (and .cse12 (<= .cse3 ULTIMATE.start_main_~j~0) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse13)) (and .cse12 (<= 2 ULTIMATE.start_main_~i~0) .cse9 .cse10 (<= (+ .cse3 2) ULTIMATE.start_main_~n~0) .cse7 .cse8 .cse13 (<= 2 ULTIMATE.start_main_~j~0))))))))) [2019-11-19 22:05:39,632 INFO L444 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,632 INFO L444 ceAbstractionStarter]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2019-11-19 22:05:39,632 INFO L440 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (let ((.cse5 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse7 (<= .cse5 ULTIMATE.start_main_~r~0)) (.cse9 (<= .cse5 ULTIMATE.start_main_~j~0)) (.cse0 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0)))) (.cse14 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse13 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= 2 ULTIMATE.start_main_~j~0)) (.cse12 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 (let ((.cse11 (* 3 ULTIMATE.start_main_~r~0))) (let ((.cse1 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse10 (and .cse2 .cse3 .cse4 .cse12 (<= 14 (+ .cse11 (* 4 ULTIMATE.start_main_~l~0))) .cse13 .cse6 .cse7))) (or (and (or (and .cse1 .cse2 (<= 2 ULTIMATE.start_main_~i~0) .cse3 .cse4 (<= (+ .cse5 2) ULTIMATE.start_main_~n~0) .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10)) (<= (+ .cse11 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0)))) (and .cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse9 .cse10))))) (and (and (and .cse2 .cse14 .cse4 .cse12 .cse13 .cse6 .cse7) .cse9) .cse0) (and .cse14 (and (and .cse13 (and .cse2 .cse3 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse8) .cse12) .cse4))))) [2019-11-19 22:05:39,633 INFO L444 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,633 INFO L440 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (let ((.cse10 (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2))) (.cse6 (* 2 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse12 (<= 1 ULTIMATE.start_main_~r~0)) (.cse13 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0))) (let ((.cse3 (and (and .cse8 .cse7 .cse12) .cse13)) (.cse5 (<= .cse6 ULTIMATE.start_main_~r~0)) (.cse11 (<= .cse10 (+ ULTIMATE.start_main_~l~0 1))) (.cse2 (<= 1 ULTIMATE.start_main_~i~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0)) (.cse4 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (<= 1 ULTIMATE.start_main_~l~0))) (or (and .cse0 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse1 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))))) (or (and .cse1 (and .cse2 .cse3 .cse4 .cse5) (<= .cse6 ULTIMATE.start_main_~j~0)) (and .cse1 (and .cse7 .cse8) (<= (+ .cse6 2) ULTIMATE.start_main_~n~0) (<= 2 ULTIMATE.start_main_~i~0) .cse4 .cse5 .cse9)))) (and .cse0 (and .cse2 (<= .cse10 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse11 .cse3 .cse4 .cse5)) (and .cse11 (and .cse2 (and (and (and .cse12 (<= ULTIMATE.start_main_~l~0 1) .cse9) .cse13) .cse8 .cse7) .cse4 .cse0))))) [2019-11-19 22:05:39,633 INFO L444 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,634 INFO L440 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= 1 ULTIMATE.start_main_~r~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse11 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse1 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse9 (<= .cse11 ULTIMATE.start_main_~j~0)) (.cse7 (<= .cse11 ULTIMATE.start_main_~r~0)) (.cse8 (and (and .cse0 .cse6 .cse4 (<= (+ ULTIMATE.start_main_~r~0 .cse11) (* 2 ULTIMATE.start_main_~n~0)) .cse2) .cse5)) (.cse3 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 (and (and (and (and .cse2 (<= ULTIMATE.start_main_~l~0 1) .cse3) .cse4) .cse5) .cse6)) (and (and .cse1 .cse7 .cse8) .cse9) (and (let ((.cse12 (* 3 ULTIMATE.start_main_~r~0))) (let ((.cse10 (and (and .cse7 .cse8 (<= 14 (+ .cse12 (* 4 ULTIMATE.start_main_~l~0)))) .cse3))) (or (and (and .cse10 (<= (+ .cse11 2) ULTIMATE.start_main_~n~0)) (<= (+ .cse12 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0)))) (and .cse10 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse9)))) (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))))))) [2019-11-19 22:05:39,634 INFO L444 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,634 INFO L440 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (let ((.cse7 (* 2 ULTIMATE.start_main_~l~0)) (.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))) (let ((.cse1 (<= 2 ULTIMATE.start_main_~j~0)) (.cse0 (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2))) (.cse8 (and (and .cse3 .cse5) .cse4 .cse2)) (.cse9 (<= .cse7 ULTIMATE.start_main_~r~0))) (or (and (<= .cse0 (+ ULTIMATE.start_main_~l~0 1)) (and (and (and (and (and (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse1) .cse2) .cse3) .cse4) .cse5)) (and (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse6 (and (and .cse8 .cse9) .cse1))) (or (and (<= (+ (* 3 ULTIMATE.start_main_~r~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (and .cse6 (<= (+ .cse7 2) ULTIMATE.start_main_~n~0))) (and (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))) .cse6 (<= .cse7 ULTIMATE.start_main_~j~0))))) (and (<= .cse0 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse8 .cse9)))) [2019-11-19 22:05:39,634 INFO L444 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,634 INFO L440 ceAbstractionStarter]: At program point L4-29(lines 3 8) the Hoare annotation is: (let ((.cse1 (* 2 ULTIMATE.start_main_~l~0)) (.cse5 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse6 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= 1 ULTIMATE.start_main_~l~0))) (let ((.cse3 (and .cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse7)) (.cse4 (<= .cse1 ULTIMATE.start_main_~r~0)) (.cse2 (<= .cse1 ULTIMATE.start_main_~j~0))) (or (and (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse0 (and (and .cse3 .cse4) (<= 2 ULTIMATE.start_main_~j~0)))) (or (and (<= (+ (* 3 ULTIMATE.start_main_~r~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (and .cse0 (<= (+ .cse1 2) ULTIMATE.start_main_~n~0))) (and (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))) .cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2)))) (and (and .cse3 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse4) .cse2) (and (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~j~0) (and (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) .cse5 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1)) .cse7))))) [2019-11-19 22:05:39,634 INFO L444 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,635 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,635 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,635 INFO L440 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (< 1 ULTIMATE.start_main_~l~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (<= 2 ULTIMATE.start_main_~j~0)) [2019-11-19 22:05:39,635 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,635 INFO L444 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,635 INFO L444 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,635 INFO L444 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,636 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,636 INFO L440 ceAbstractionStarter]: At program point L4-35(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (<= 2 ULTIMATE.start_main_~l~0) (<= 2 ULTIMATE.start_main_~j~0)) [2019-11-19 22:05:39,636 INFO L444 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,636 INFO L444 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,636 INFO L444 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,636 INFO L444 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,637 INFO L440 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~l~0) (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) (<= (+ ULTIMATE.start_main_~l~0 1) ULTIMATE.start_main_~n~0)) [2019-11-19 22:05:39,637 INFO L444 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,637 INFO L444 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-11-19 22:05:39,637 INFO L444 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,637 INFO L444 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,637 INFO L440 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (let ((.cse1 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse0 (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~l~0) (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) (<= .cse1 ULTIMATE.start_main_~n~0)))) (or (and .cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) .cse1) .cse0)))) [2019-11-19 22:05:39,637 INFO L444 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,637 INFO L444 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,638 INFO L444 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,638 INFO L447 ceAbstractionStarter]: At program point L55(lines 10 56) the Hoare annotation is: true [2019-11-19 22:05:39,638 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,638 INFO L440 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse2 (- ULTIMATE.start_main_~r~0))) (let ((.cse27 (div ULTIMATE.start_main_~j~0 2)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse17 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= 1 ULTIMATE.start_main_~l~0)) (.cse24 (<= 1 ULTIMATE.start_main_~r~0)) (.cse25 (<= ULTIMATE.start_main_~l~0 1)) (.cse26 (div (+ .cse2 (- 1)) (- 2))) (.cse3 (+ ULTIMATE.start_main_~l~0 1)) (.cse19 (* 8 ULTIMATE.start_main_~n~0)) (.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse29 (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse0 (<= (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~i~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) .cse29))) (.cse6 (<= (+ .cse10 2) ULTIMATE.start_main_~n~0)) (.cse15 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ .cse19 .cse29))) (.cse8 (<= .cse10 ULTIMATE.start_main_~r~0)) (.cse12 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse4 (<= 2 ULTIMATE.start_main_~i~0)) (.cse18 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= .cse26 .cse3)) (.cse23 (and (<= 1 .cse27) .cse1 .cse17 .cse7 .cse24 .cse25 (<= .cse3 ULTIMATE.start_main_~n~0))) (.cse11 (exists ((v_ULTIMATE.start_main_~j~0_20 Int)) (let ((.cse28 (div v_ULTIMATE.start_main_~j~0_20 2))) (and (<= (* 2 v_ULTIMATE.start_main_~j~0_20) ULTIMATE.start_main_~j~0) (<= 1 .cse28) (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ .cse28 1)))))) (.cse20 (<= .cse26 (+ .cse27 1))) (.cse13 (<= ULTIMATE.start_main_~j~0 .cse10)) (.cse21 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse14 (<= 1 ULTIMATE.start_main_~i~0)) (.cse16 (<= 2 ULTIMATE.start_main_~j~0))) (or (or (and .cse0 .cse1 (<= (div .cse2 (- 2)) .cse3) .cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse5 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse5 1)) (<= 1 .cse5) (<= (+ v_ULTIMATE.start_main_~j~0_23 1) (div ULTIMATE.start_main_~j~0 2))))) .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse4 (<= (+ ULTIMATE.start_main_~r~0 .cse10) (* 2 ULTIMATE.start_main_~n~0)) .cse7 .cse11 .cse8)) (and .cse12 .cse1 .cse13 (<= .cse10 ULTIMATE.start_main_~j~0) .cse14 .cse15 .cse8 .cse16) (and (or (and .cse0 .cse1 .cse4 .cse17 .cse6 .cse7 .cse8) (and .cse12 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8)) .cse15 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0))) (<= (+ (* 5 ULTIMATE.start_main_~r~0) 23) (+ (* 8 ULTIMATE.start_main_~l~0) .cse19))) (and .cse20 .cse13 .cse21 .cse14 .cse15 .cse8 .cse16) (and .cse12 .cse4 .cse18 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse22 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse22 1)) (<= 1 .cse22)))) .cse23) (and .cse9 .cse23 .cse11) (and .cse1 .cse20 .cse13 (and .cse17 .cse21 (and .cse14 (and .cse24 .cse25 .cse16)))))))) [2019-11-19 22:05:39,638 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2019-11-19 22:05:39,638 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point L25-1(lines 25 32) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,639 INFO L444 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-11-19 22:05:39,640 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-19 22:05:39,640 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,640 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,640 INFO L444 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-11-19 22:05:39,640 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 22:05:39,640 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-11-19 22:05:39,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:05:39 BoogieIcfgContainer [2019-11-19 22:05:39,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:05:39,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:05:39,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:05:39,767 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:05:39,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:15" (3/4) ... [2019-11-19 22:05:39,772 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:05:39,787 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-19 22:05:39,788 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:05:39,788 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 22:05:39,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (-r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1 && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2) && v_ULTIMATE.start_main_~j~0_23 + 1 <= j / 2)) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || ((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && 2 <= i) && r + 2 * l <= 2 * n) && 1 <= l) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && 2 * l <= r)) || ((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && 5 * r + 23 <= 8 * l + 8 * n)) || (((((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n)) || (((-r + -1) / -2 <= l + 1 && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1))) || (((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && (r <= n && i + 1 <= n) && 1 <= i && (1 <= r && l <= 1) && 2 <= j) [2019-11-19 22:05:39,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) [2019-11-19 22:05:39,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && 5 * r + 6 * l + 3 <= 8 * n) || (((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && r <= 2 * l)) || ((-r + -1) / -2 <= l + 1 && (((((((1 <= j / 2 && 1 <= i) && 1 == cond) && 1 <= l) && r <= n) && j <= n) && 1 <= r) && i + 1 <= n) && l <= 1)) || (8 * r + 6 * l <= 8 * n + 3 * j && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((r <= n && j <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r) && 2 <= j))) [2019-11-19 22:05:39,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) [2019-11-19 22:05:39,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((8 * r + 6 * l <= 8 * n + 3 * j && ((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r)) && 3 * r + 10 <= 4 * n + 2 * j) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 1 == cond) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r))) || ((((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 <= l) && 2 * l <= r) && 2 * l <= j) && 8 * r + 6 * l <= 8 * n + 3 * j)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((!(0 == cond) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && j <= n) [2019-11-19 22:05:39,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) [2019-11-19 22:05:39,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) [2019-11-19 22:05:39,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= l && 8 * r + 6 * l <= 8 * n + 3 * j) && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((1 <= i && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r) && 2 * l <= j) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= n && r <= n) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && 2 * l <= r) && 2 <= j))) || (1 <= l && ((((1 <= i && (-r + -1) / -2 <= j / 2 + 1) && (-r + -1) / -2 <= l + 1) && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((1 <= r && l <= 1) && 2 <= j) && i + 1 <= n) && r <= n) && j <= n) && 1 == cond) && 1 <= l) [2019-11-19 22:05:39,825 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == cond) && (-r + -1) / -2 <= l + 1) && ((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 <= l) && r <= n) || ((((-r + -1) / -2 <= l + 1 && 2 * l <= r) && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 2 * l <= j)) || (((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && 2 * l + 2 <= n) && 3 * r + 10 <= 4 * n + 2 * j) || ((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 1 == cond) && 2 * l <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) [2019-11-19 22:05:39,825 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((-r + -1) / -2 <= l + 1 && (((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 == cond) && r <= n) && 1 <= l) || (8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l <= j)))) || (((-r + -1) / -2 <= j / 2 + 1 && ((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) [2019-11-19 22:05:39,825 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 1 == cond) && 2 * l <= j))) || ((((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && (-r + -1) / -2 <= l + 1) && 2 * l <= r) && 2 * l <= j)) || (r <= j && ((((1 <= j / 2 && !(0 == cond)) && j <= n) && 1 <= r) && l <= 1) && 1 <= l) [2019-11-19 22:05:39,851 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8aa9191a-d402-4ffa-92ea-03c26e9236d7/bin/uautomizer/witness.graphml [2019-11-19 22:05:39,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:05:39,852 INFO L168 Benchmark]: Toolchain (without parser) took 85044.64 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 543.7 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 345.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:05:39,853 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:05:39,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -231.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:05:39,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:05:39,854 INFO L168 Benchmark]: Boogie Preprocessor took 73.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:05:39,854 INFO L168 Benchmark]: RCFGBuilder took 539.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:05:39,855 INFO L168 Benchmark]: TraceAbstraction took 83944.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -16.3 MB). Peak memory consumption was 631.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:05:39,855 INFO L168 Benchmark]: Witness Printer took 84.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:05:39,857 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.38 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -231.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 539.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 83944.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -16.3 MB). Peak memory consumption was 631.9 MB. Max. memory is 11.5 GB. * Witness Printer took 84.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 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_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((1 <= l && 8 * r + 6 * l <= 8 * n + 3 * j) && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((1 <= i && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r) && 2 * l <= j) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= n && r <= n) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && 2 * l <= r) && 2 <= j))) || (1 <= l && ((((1 <= i && (-r + -1) / -2 <= j / 2 + 1) && (-r + -1) / -2 <= l + 1) && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((1 <= r && l <= 1) && 2 <= j) && i + 1 <= n) && r <= n) && j <= n) && 1 == cond) && 1 <= l) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) && 1 == cond) || ((-r + -1) / -2 <= l + 1 && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: ((8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 1 == cond) && 2 * l <= j))) || ((((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && (-r + -1) / -2 <= l + 1) && 2 * l <= r) && 2 * l <= j)) || (r <= j && ((((1 <= j / 2 && !(0 == cond)) && j <= n) && 1 <= r) && l <= 1) && 1 <= l) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: ((8 * r + 6 * l <= 8 * n + 3 * j && ((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r)) && 3 * r + 10 <= 4 * n + 2 * j) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 1 == cond) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r))) || ((((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 <= l) && 2 * l <= r) && 2 * l <= j) && 8 * r + 6 * l <= 8 * n + 3 * j)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((!(0 == cond) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && j <= n) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((-r + -1) / -2 <= l + 1 && (((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 == cond) && r <= n) && 1 <= l) || (8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l <= j)))) || (((-r + -1) / -2 <= j / 2 + 1 && ((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && 5 * r + 6 * l + 3 <= 8 * n) || (((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && r <= 2 * l)) || ((-r + -1) / -2 <= l + 1 && (((((((1 <= j / 2 && 1 <= i) && 1 == cond) && 1 <= l) && r <= n) && j <= n) && 1 <= r) && i + 1 <= n) && l <= 1)) || (8 * r + 6 * l <= 8 * n + 3 * j && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((r <= n && j <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r) && 2 <= j))) - InvariantResult [Line: 24]: Loop Invariant [2019-11-19 22:05:39,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-19 22:05:39,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] Derived loop invariant: (((((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (-r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1 && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2) && v_ULTIMATE.start_main_~j~0_23 + 1 <= j / 2)) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || ((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && 2 <= i) && r + 2 * l <= 2 * n) && 1 <= l) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && 2 * l <= r)) || ((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && 5 * r + 23 <= 8 * l + 8 * n)) || (((((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n)) || (((-r + -1) / -2 <= l + 1 && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1))) || (((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && (r <= n && i + 1 <= n) && 1 <= i && (1 <= r && l <= 1) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((!(0 == cond) && r <= n) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= l) && 2 <= j - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((!(0 == cond) && (-r + -1) / -2 <= l + 1) && ((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 <= l) && r <= n) || ((((-r + -1) / -2 <= l + 1 && 2 * l <= r) && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 2 * l <= j)) || (((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && 2 * l + 2 <= n) && 3 * r + 10 <= 4 * n + 2 * j) || ((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 1 == cond) && 2 * l <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) - InvariantResult [Line: 3]: Loop Invariant [2019-11-19 22:05:39,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-19 22:05:39,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-19 22:05:39,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-19 22:05:39,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((1 < l && 1 == cond) && r <= n) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 14 error locations. Result: SAFE, OverallTime: 83.7s, OverallIterations: 20, TraceHistogramMax: 4, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.7s, HoareTripleCheckerStatistics: 1127 SDtfs, 4851 SDslu, 3350 SDs, 0 SdLazy, 6724 SolverSat, 3064 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 355 SyntacticMatches, 4 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13831 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 1930 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 675 NumberOfFragments, 3553 HoareAnnotationTreeSize, 16 FomulaSimplifications, 916295071 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 128391470 FormulaSimplificationTreeSizeReductionInter, 42.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 823 ConstructedInterpolants, 62 QuantifiedInterpolants, 331598 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1039 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 140/394 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...