./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 231a10bb05ed6dc00d2658e900a2b37af0aae558 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:39:07,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:39:07,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:39:07,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:39:07,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:39:07,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:39:07,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:39:07,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:39:07,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:39:07,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:39:07,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:39:07,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:39:07,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:39:07,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:39:07,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:39:07,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:39:07,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:39:07,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:39:07,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:39:07,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:39:07,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:39:07,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:39:07,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:39:07,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:39:07,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:39:07,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:39:07,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:39:07,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:39:07,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:39:07,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:39:07,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:39:07,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:39:07,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:39:07,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:39:07,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:39:07,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:39:07,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:39:07,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:39:07,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:39:07,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:39:07,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:39:07,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:39:07,420 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:39:07,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:39:07,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:39:07,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:39:07,428 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:39:07,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:39:07,429 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:39:07,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:39:07,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:39:07,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:39:07,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:39:07,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:39:07,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:39:07,432 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:39:07,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:39:07,432 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:39:07,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:39:07,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:39:07,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:39:07,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:39:07,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:39:07,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:39:07,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:39:07,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:39:07,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:39:07,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:39:07,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:39:07,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:39:07,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:39:07,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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(reach_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 -> 231a10bb05ed6dc00d2658e900a2b37af0aae558 [2020-11-29 20:39:07,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:39:07,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:39:07,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:39:07,898 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:39:07,899 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:39:07,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/../../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2020-11-29 20:39:07,987 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/data/1cb57f844/c7af82fe0e6f44d1a76fde3d006e61d5/FLAGc8e045887 [2020-11-29 20:39:08,559 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:39:08,560 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2020-11-29 20:39:08,571 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/data/1cb57f844/c7af82fe0e6f44d1a76fde3d006e61d5/FLAGc8e045887 [2020-11-29 20:39:08,908 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/data/1cb57f844/c7af82fe0e6f44d1a76fde3d006e61d5 [2020-11-29 20:39:08,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:39:08,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:39:08,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:39:08,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:39:08,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:39:08,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:39:08" (1/1) ... [2020-11-29 20:39:08,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2024605e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:08, skipping insertion in model container [2020-11-29 20:39:08,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:39:08" (1/1) ... [2020-11-29 20:39:08,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:39:08,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:39:09,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:39:09,135 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:39:09,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:39:09,182 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:39:09,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09 WrapperNode [2020-11-29 20:39:09,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:39:09,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:39:09,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:39:09,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:39:09,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:39:09,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:39:09,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:39:09,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:39:09,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... [2020-11-29 20:39:09,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:39:09,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:39:09,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:39:09,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:39:09,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:09,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:39:09,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:39:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:39:09,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:39:09,715 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:39:09,715 INFO L298 CfgBuilder]: Removed 40 assume(true) statements. [2020-11-29 20:39:09,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:39:09 BoogieIcfgContainer [2020-11-29 20:39:09,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:39:09,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:39:09,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:39:09,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:39:09,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:39:08" (1/3) ... [2020-11-29 20:39:09,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8ed21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:39:09, skipping insertion in model container [2020-11-29 20:39:09,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:39:09" (2/3) ... [2020-11-29 20:39:09,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8ed21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:39:09, skipping insertion in model container [2020-11-29 20:39:09,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:39:09" (3/3) ... [2020-11-29 20:39:09,736 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.c [2020-11-29 20:39:09,747 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:39:09,752 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-11-29 20:39:09,761 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 20:39:09,786 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:39:09,786 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:39:09,787 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:39:09,787 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:39:09,787 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:39:09,787 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:39:09,788 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:39:09,788 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:39:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-29 20:39:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 20:39:09,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:09,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:09,814 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2020-11-29 20:39:09,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:09,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403508295] [2020-11-29 20:39:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:09,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403508295] [2020-11-29 20:39:09,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:39:09,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:39:09,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146371267] [2020-11-29 20:39:09,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 20:39:09,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 20:39:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 20:39:10,012 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2020-11-29 20:39:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:10,034 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2020-11-29 20:39:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 20:39:10,035 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-11-29 20:39:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:10,044 INFO L225 Difference]: With dead ends: 83 [2020-11-29 20:39:10,045 INFO L226 Difference]: Without dead ends: 39 [2020-11-29 20:39:10,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 20:39:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-29 20:39:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-29 20:39:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-29 20:39:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-29 20:39:10,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2020-11-29 20:39:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:10,094 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-29 20:39:10,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 20:39:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-29 20:39:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 20:39:10,095 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:10,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:10,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:39:10,096 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2020-11-29 20:39:10,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:10,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114481700] [2020-11-29 20:39:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:10,126 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:10,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142684779] [2020-11-29 20:39:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:10,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 20:39:10,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:10,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-29 20:39:10,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:10,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114481700] [2020-11-29 20:39:10,455 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:10,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142684779] [2020-11-29 20:39:10,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:39:10,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:39:10,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740668643] [2020-11-29 20:39:10,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:39:10,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:10,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:39:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:39:10,460 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 6 states. [2020-11-29 20:39:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:10,810 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-11-29 20:39:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:39:10,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-11-29 20:39:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:10,813 INFO L225 Difference]: With dead ends: 52 [2020-11-29 20:39:10,813 INFO L226 Difference]: Without dead ends: 50 [2020-11-29 20:39:10,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:39:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-29 20:39:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2020-11-29 20:39:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-29 20:39:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-11-29 20:39:10,834 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2020-11-29 20:39:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:10,835 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-11-29 20:39:10,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:39:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-11-29 20:39:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 20:39:10,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:10,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:11,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-11-29 20:39:11,037 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1277140292, now seen corresponding path program 1 times [2020-11-29 20:39:11,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:11,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309987836] [2020-11-29 20:39:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:11,056 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:11,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4306832] [2020-11-29 20:39:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:11,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 20:39:11,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:11,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-29 20:39:11,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:11,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309987836] [2020-11-29 20:39:11,187 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:11,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4306832] [2020-11-29 20:39:11,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:39:11,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:39:11,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695395038] [2020-11-29 20:39:11,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:39:11,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:11,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:39:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:39:11,190 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 6 states. [2020-11-29 20:39:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:11,471 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-11-29 20:39:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:39:11,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-29 20:39:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:11,473 INFO L225 Difference]: With dead ends: 69 [2020-11-29 20:39:11,473 INFO L226 Difference]: Without dead ends: 61 [2020-11-29 20:39:11,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:39:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-29 20:39:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2020-11-29 20:39:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-29 20:39:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-11-29 20:39:11,493 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2020-11-29 20:39:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:11,493 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-11-29 20:39:11,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:39:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-11-29 20:39:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 20:39:11,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:11,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:11,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:39:11,719 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1834773734, now seen corresponding path program 1 times [2020-11-29 20:39:11,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:11,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951546966] [2020-11-29 20:39:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:11,737 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:11,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96038780] [2020-11-29 20:39:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:11,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 20:39:11,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:11,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951546966] [2020-11-29 20:39:11,834 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:11,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96038780] [2020-11-29 20:39:11,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:39:11,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:39:11,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796139700] [2020-11-29 20:39:11,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:39:11,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:11,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:39:11,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:39:11,836 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2020-11-29 20:39:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:11,978 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2020-11-29 20:39:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:39:11,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-29 20:39:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:11,981 INFO L225 Difference]: With dead ends: 95 [2020-11-29 20:39:11,981 INFO L226 Difference]: Without dead ends: 89 [2020-11-29 20:39:11,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:39:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-29 20:39:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2020-11-29 20:39:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-29 20:39:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2020-11-29 20:39:11,997 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 16 [2020-11-29 20:39:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:11,997 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2020-11-29 20:39:11,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:39:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2020-11-29 20:39:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 20:39:11,998 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:11,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:12,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:39:12,215 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1756992684, now seen corresponding path program 1 times [2020-11-29 20:39:12,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:12,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77697280] [2020-11-29 20:39:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:12,235 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:12,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490216669] [2020-11-29 20:39:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:12,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:39:12,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:12,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-29 20:39:12,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:12,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:12,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77697280] [2020-11-29 20:39:12,449 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:12,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490216669] [2020-11-29 20:39:12,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:39:12,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:39:12,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487122015] [2020-11-29 20:39:12,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:39:12,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:39:12,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:39:12,452 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 6 states. [2020-11-29 20:39:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:12,703 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2020-11-29 20:39:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:39:12,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-29 20:39:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:12,705 INFO L225 Difference]: With dead ends: 72 [2020-11-29 20:39:12,705 INFO L226 Difference]: Without dead ends: 70 [2020-11-29 20:39:12,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:39:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-29 20:39:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-29 20:39:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-29 20:39:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2020-11-29 20:39:12,717 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 20 [2020-11-29 20:39:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:12,717 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2020-11-29 20:39:12,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:39:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-11-29 20:39:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 20:39:12,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:12,723 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:12,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:39:12,951 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 746982291, now seen corresponding path program 1 times [2020-11-29 20:39:12,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:12,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505724073] [2020-11-29 20:39:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:12,969 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:12,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735403575] [2020-11-29 20:39:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:13,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-29 20:39:13,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:13,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 20:39:13,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:13,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-29 20:39:13,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:13,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:39:13,983 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-11-29 20:39:13,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-11-29 20:39:13,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:14,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:14,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:39:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:14,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505724073] [2020-11-29 20:39:14,986 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:14,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735403575] [2020-11-29 20:39:14,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:39:14,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-29 20:39:14,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408914951] [2020-11-29 20:39:14,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 20:39:14,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 20:39:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=143, Unknown=2, NotChecked=0, Total=182 [2020-11-29 20:39:14,997 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2020-11-29 20:39:15,773 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2020-11-29 20:39:15,991 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2020-11-29 20:39:16,224 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2020-11-29 20:39:18,125 WARN L193 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-11-29 20:39:20,052 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-11-29 20:39:21,626 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2020-11-29 20:39:22,759 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2020-11-29 20:39:23,526 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-11-29 20:39:30,899 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-11-29 20:39:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:31,618 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2020-11-29 20:39:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-29 20:39:31,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-11-29 20:39:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:31,629 INFO L225 Difference]: With dead ends: 144 [2020-11-29 20:39:31,629 INFO L226 Difference]: Without dead ends: 95 [2020-11-29 20:39:31,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=239, Invalid=553, Unknown=20, NotChecked=0, Total=812 [2020-11-29 20:39:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-29 20:39:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2020-11-29 20:39:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-29 20:39:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-11-29 20:39:31,657 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2020-11-29 20:39:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:31,658 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-11-29 20:39:31,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 20:39:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-11-29 20:39:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 20:39:31,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:31,661 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:31,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-29 20:39:31,887 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash 23956023, now seen corresponding path program 1 times [2020-11-29 20:39:31,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:31,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110969843] [2020-11-29 20:39:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:31,904 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:31,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67867649] [2020-11-29 20:39:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:31,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 20:39:31,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:32,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110969843] [2020-11-29 20:39:32,044 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:32,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67867649] [2020-11-29 20:39:32,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:39:32,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-29 20:39:32,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069425938] [2020-11-29 20:39:32,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:39:32,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:39:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:39:32,046 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2020-11-29 20:39:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:32,277 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2020-11-29 20:39:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:39:32,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-29 20:39:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:32,280 INFO L225 Difference]: With dead ends: 91 [2020-11-29 20:39:32,280 INFO L226 Difference]: Without dead ends: 83 [2020-11-29 20:39:32,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:39:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-29 20:39:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2020-11-29 20:39:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-29 20:39:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-11-29 20:39:32,321 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 26 [2020-11-29 20:39:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:32,321 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-11-29 20:39:32,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:39:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-11-29 20:39:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 20:39:32,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:32,326 INFO L422 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] [2020-11-29 20:39:32,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:39:32,543 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1714844836, now seen corresponding path program 1 times [2020-11-29 20:39:32,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:32,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380639544] [2020-11-29 20:39:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:32,566 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:32,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596923532] [2020-11-29 20:39:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:39:32,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-29 20:39:32,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:32,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 20:39:32,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:39:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:32,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380639544] [2020-11-29 20:39:32,998 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:32,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596923532] [2020-11-29 20:39:32,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:39:32,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-29 20:39:32,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112255756] [2020-11-29 20:39:32,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 20:39:32,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:32,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:39:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:39:33,000 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 13 states. [2020-11-29 20:39:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:33,550 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2020-11-29 20:39:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 20:39:33,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2020-11-29 20:39:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:33,558 INFO L225 Difference]: With dead ends: 116 [2020-11-29 20:39:33,558 INFO L226 Difference]: Without dead ends: 69 [2020-11-29 20:39:33,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2020-11-29 20:39:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-29 20:39:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-29 20:39:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-29 20:39:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-11-29 20:39:33,577 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 35 [2020-11-29 20:39:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:33,577 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-11-29 20:39:33,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 20:39:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-11-29 20:39:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 20:39:33,578 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:39:33,585 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:39:33,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:39:33,799 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:39:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:39:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 810001052, now seen corresponding path program 2 times [2020-11-29 20:39:33,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:39:33,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535983427] [2020-11-29 20:39:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:39:33,811 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 20:39:33,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709560064] [2020-11-29 20:39:33,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/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 [2020-11-29 20:39:33,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:39:33,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:39:33,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 20:39:33,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:39:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:39:33,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535983427] [2020-11-29 20:39:33,909 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 20:39:33,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709560064] [2020-11-29 20:39:33,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:39:33,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:39:33,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550454989] [2020-11-29 20:39:33,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:39:33,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:39:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:39:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:39:33,911 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 5 states. [2020-11-29 20:39:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:39:33,971 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-11-29 20:39:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:39:33,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-11-29 20:39:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:39:33,973 INFO L225 Difference]: With dead ends: 69 [2020-11-29 20:39:33,973 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 20:39:33,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:39:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 20:39:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 20:39:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 20:39:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 20:39:33,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-11-29 20:39:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:39:33,974 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 20:39:33,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:39:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 20:39:33,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 20:39:34,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-11-29 20:39:34,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 20:39:34,501 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-11-29 20:39:34,729 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2020-11-29 20:39:35,321 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-11-29 20:39:35,495 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2020-11-29 20:39:35,704 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-11-29 20:39:35,921 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-29 20:39:36,033 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2020-11-29 20:39:36,234 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-29 20:39:36,237 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,237 INFO L274 CegarLoopResult]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-11-29 20:39:36,237 INFO L274 CegarLoopResult]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2020-11-29 20:39:36,237 INFO L274 CegarLoopResult]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L270 CegarLoopResult]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse1 (* ULTIMATE.start_main_~y~0 2)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse3 (<= ULTIMATE.start_main_~x~0 2)) (.cse4 (<= 0 ULTIMATE.start_main_~x~0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse0 (let ((.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0))) (or (and .cse2 .cse6 .cse3 (= ULTIMATE.start_main_~a~0 2) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse7 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (<= (+ (* 2 ULTIMATE.start_main_~y~0) .cse7) 2) (<= 0 .cse7)))) .cse4 (= ULTIMATE.start_main_~b~0 .cse1) .cse5) (and .cse2 .cse6 .cse3 (= ULTIMATE.start_main_~a~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))))) (or (and (= ULTIMATE.start_main_~q~0 2) .cse0 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse1)) (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (and .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse5 (= ULTIMATE.start_main_~b~0 0)) (and (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse0 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0))))) [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2020-11-29 20:39:36,238 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,239 INFO L270 CegarLoopResult]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and .cse0 (<= ULTIMATE.start_main_~x~0 2) (= ULTIMATE.start_main_~a~0 2) .cse1 .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) .cse4) (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 (= ULTIMATE.start_main_~a~0 1) .cse1 .cse2 (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse6 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse5 (+ ULTIMATE.start_main_~r~0 .cse6))) (and (<= .cse5 2) (<= 0 .cse6) (<= 0 .cse5))))) .cse3 .cse4 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2020-11-29 20:39:36,239 INFO L274 CegarLoopResult]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2020-11-29 20:39:36,239 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,239 INFO L274 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,241 INFO L270 CegarLoopResult]: At program point L15-1(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (<= ULTIMATE.start_main_~x~0 2)) (.cse2 (<= 0 ULTIMATE.start_main_~x~0)) (.cse5 (* ULTIMATE.start_main_~y~0 2)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse4 (let ((.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0))) (or (and .cse6 .cse0 .cse1 (= ULTIMATE.start_main_~a~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse3 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse6 .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse7 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (<= (+ (* 2 ULTIMATE.start_main_~y~0) .cse7) 2) (<= 0 .cse7)))) .cse2 (= ULTIMATE.start_main_~b~0 .cse5) .cse3))))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse3) (and (= ULTIMATE.start_main_~q~0 2) .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (and (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse4 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0))))) [2020-11-29 20:39:36,241 INFO L274 CegarLoopResult]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,241 INFO L270 CegarLoopResult]: At program point L15-3(lines 42 43) the Hoare annotation is: (let ((.cse2 (* ULTIMATE.start_main_~y~0 2)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (<= ULTIMATE.start_main_~x~0 2)) (.cse5 (<= 0 ULTIMATE.start_main_~x~0)) (.cse6 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (let ((.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0))) (or (and .cse7 .cse3 .cse4 (= ULTIMATE.start_main_~a~0 2) (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse8 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (<= (+ (* 2 ULTIMATE.start_main_~y~0) .cse8) 2) (<= 0 .cse8)))) .cse5 (= ULTIMATE.start_main_~b~0 .cse2) .cse6) (and .cse7 .cse3 .cse4 (= ULTIMATE.start_main_~a~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse5 (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse10 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse9 (+ ULTIMATE.start_main_~r~0 .cse10))) (and (<= .cse9 2) (<= 0 .cse10) (<= 0 .cse9))))) .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))))) (or (and (= ULTIMATE.start_main_~q~0 2) .cse0 .cse1 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse2)) (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (and .cse3 .cse4 .cse0 .cse5 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse6) (and (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) .cse1)))) [2020-11-29 20:39:36,241 INFO L274 CegarLoopResult]: For program point L15-4(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,241 INFO L270 CegarLoopResult]: At program point L15-5(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse2 (= ULTIMATE.start_main_~q~0 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and .cse0 (<= ULTIMATE.start_main_~x~0 2) (= ULTIMATE.start_main_~a~0 2) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse2 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) .cse3) (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 (= ULTIMATE.start_main_~a~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse5 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse4 (+ ULTIMATE.start_main_~r~0 .cse5))) (and (<= .cse4 2) (<= 0 .cse5) (<= 0 .cse4))))) .cse2 .cse3 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2020-11-29 20:39:36,241 INFO L274 CegarLoopResult]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,242 INFO L270 CegarLoopResult]: At program point L15-7(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse2 (= ULTIMATE.start_main_~q~0 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and .cse0 (<= ULTIMATE.start_main_~x~0 2) (= ULTIMATE.start_main_~a~0 2) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse2 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) .cse3) (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 (= ULTIMATE.start_main_~a~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse5 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse4 (+ ULTIMATE.start_main_~r~0 .cse5))) (and (<= .cse4 2) (<= 0 .cse5) (<= 0 .cse4))))) .cse2 .cse3 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2020-11-29 20:39:36,242 INFO L274 CegarLoopResult]: For program point L15-8(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,242 INFO L270 CegarLoopResult]: At program point L15-9(lines 52 53) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 (= ULTIMATE.start_main_~a~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse3 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse2 (+ ULTIMATE.start_main_~r~0 .cse3))) (and (<= .cse2 2) (<= 0 .cse3) (<= 0 .cse2))))) .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 (<= ULTIMATE.start_main_~x~0 2) (= ULTIMATE.start_main_~a~0 2) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse4 .cse5 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0)))) [2020-11-29 20:39:36,242 INFO L274 CegarLoopResult]: For program point L15-10(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,242 INFO L270 CegarLoopResult]: At program point L15-11(lines 14 20) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 1) (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~r~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (exists ((ULTIMATE.start_main_~q~0 Int)) (let ((.cse1 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse0 (+ ULTIMATE.start_main_~r~0 .cse1))) (and (<= .cse0 2) (<= 0 .cse1) (<= 0 .cse0))))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) [2020-11-29 20:39:36,242 INFO L274 CegarLoopResult]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2020-11-29 20:39:36,242 INFO L277 CegarLoopResult]: At program point L15-13(lines 14 20) the Hoare annotation is: true [2020-11-29 20:39:36,242 INFO L277 CegarLoopResult]: At program point L65(lines 22 66) the Hoare annotation is: true [2020-11-29 20:39:36,242 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-29 20:39:36,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 20:39:36,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:39:36 BoogieIcfgContainer [2020-11-29 20:39:36,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:39:36,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:39:36,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:39:36,309 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:39:36,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:39:09" (3/4) ... [2020-11-29 20:39:36,315 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 20:39:36,331 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-11-29 20:39:36,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-29 20:39:36,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 20:39:36,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 20:39:36,355 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((q == 2 && (((((((((1 <= y && r <= x) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && r <= x) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y))) && x == r + y * 2) && 2 * y <= x) || (((((((1 <= y && x <= 2) && 0 <= x) && a == 0) && r == x) && q == 0) && cond == 1) && b == 0)) || ((((q == 1 && x == r + y) && b <= y) && (((((((((1 <= y && r <= x) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && r <= x) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y))) && r < y) [2020-11-29 20:39:36,356 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= y && x <= 2) && 0 <= x) && r == x) && q == 0) && cond == 1) || (((q == 2 && ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1))) && x == r + y * 2) && 2 * y <= x)) || ((((q == 1 && x == r + y) && b <= y) && ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1))) && r < y) [2020-11-29 20:39:36,356 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((q == 2 && 1 <= cond) && ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && cond == 1) && b == y))) && x == r + y * 2) && 2 * y <= x) || ((((((1 <= y && x <= 2) && 1 <= cond) && 0 <= x) && r == x) && q == 0) && cond == 1)) || ((((q == 1 && x == r + y) && b <= y) && r < y) && ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && cond == 1) && b == y))) [2020-11-29 20:39:36,356 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) || ((((((((1 <= r && 1 <= y) && a == 1) && 1 <= cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) [2020-11-29 20:39:36,356 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) || ((((((((1 <= r && 1 <= y) && a == 1) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) [2020-11-29 20:39:36,357 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) || ((((((((1 <= r && 1 <= y) && a == 1) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) [2020-11-29 20:39:36,357 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= r && 1 <= y) && a == 1) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) || ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && cond == 1) && 2 * y <= r) [2020-11-29 20:39:36,357 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 <= y && a == 1) && 2 * b <= r) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y [2020-11-29 20:39:36,380 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_40fc06ca-65d5-4cdf-8e9f-c4a6e58e6d67/bin/uautomizer/witness.graphml [2020-11-29 20:39:36,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:39:36,381 INFO L168 Benchmark]: Toolchain (without parser) took 27468.88 ms. Allocated memory was 86.0 MB in the beginning and 125.8 MB in the end (delta: 39.8 MB). Free memory was 50.6 MB in the beginning and 51.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 38.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:39:36,382 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 86.0 MB. Free memory is still 66.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:39:36,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.14 ms. Allocated memory is still 86.0 MB. Free memory was 50.4 MB in the beginning and 63.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2020-11-29 20:39:36,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.13 ms. Allocated memory is still 86.0 MB. Free memory was 63.1 MB in the beginning and 61.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:39:36,383 INFO L168 Benchmark]: Boogie Preprocessor took 26.17 ms. Allocated memory is still 86.0 MB. Free memory was 61.5 MB in the beginning and 60.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:39:36,384 INFO L168 Benchmark]: RCFGBuilder took 466.57 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 60.3 MB in the beginning and 82.5 MB in the end (delta: -22.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. [2020-11-29 20:39:36,384 INFO L168 Benchmark]: TraceAbstraction took 26582.18 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 82.1 MB in the beginning and 56.0 MB in the end (delta: 26.0 MB). Peak memory consumption was 70.9 MB. Max. memory is 16.1 GB. [2020-11-29 20:39:36,385 INFO L168 Benchmark]: Witness Printer took 77.86 ms. Allocated memory is still 125.8 MB. Free memory was 55.0 MB in the beginning and 51.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 20:39:36,388 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 86.0 MB. Free memory is still 66.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 263.14 ms. Allocated memory is still 86.0 MB. Free memory was 50.4 MB in the beginning and 63.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.13 ms. Allocated memory is still 86.0 MB. Free memory was 63.1 MB in the beginning and 61.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.17 ms. Allocated memory is still 86.0 MB. Free memory was 61.5 MB in the beginning and 60.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 466.57 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 60.3 MB in the beginning and 82.5 MB in the end (delta: -22.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26582.18 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 82.1 MB in the beginning and 56.0 MB in the end (delta: 26.0 MB). Peak memory consumption was 70.9 MB. Max. memory is 16.1 GB. * Witness Printer took 77.86 ms. Allocated memory is still 125.8 MB. Free memory was 55.0 MB in the beginning and 51.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 20:39:36,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) || ((((((((1 <= r && 1 <= y) && a == 1) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) - InvariantResult [Line: 52]: Loop Invariant [2020-11-29 20:39:36,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: ((((((((1 <= r && 1 <= y) && a == 1) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) || ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && cond == 1) && 2 * y <= r) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant [2020-11-29 20:39:36,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: (((((q == 2 && 1 <= cond) && ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && cond == 1) && b == y))) && x == r + y * 2) && 2 * y <= x) || ((((((1 <= y && x <= 2) && 1 <= cond) && 0 <= x) && r == x) && q == 0) && cond == 1)) || ((((q == 1 && x == r + y) && b <= y) && r < y) && ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && cond == 1) && b == y))) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant [2020-11-29 20:39:36,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) || ((((((((1 <= r && 1 <= y) && a == 1) && 1 <= cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 20:39:36,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: ((((((((1 <= y && x <= 2) && a == 2) && 1 <= cond) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) || ((((((((1 <= r && 1 <= y) && a == 1) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y) - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 20:39:36,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: ((((((1 <= y && x <= 2) && 0 <= x) && r == x) && q == 0) && cond == 1) || (((q == 2 && ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1))) && x == r + y * 2) && 2 * y <= x)) || ((((q == 1 && x == r + y) && b <= y) && ((((((((r <= x && 1 <= y) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y) || ((((((((r <= x && 1 <= y) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1))) && r < y) - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 20:39:36,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: (((((((1 <= y && a == 1) && 2 * b <= r) && 1 == cond) && r == x) && (\exists ULTIMATE.start_main_~q~0 : int :: (r + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y) && 0 <= r + ULTIMATE.start_main_~q~0 * y)) && q == 0) && cond == 1) && b == y - InvariantResult [Line: 38]: Loop Invariant [2020-11-29 20:39:36,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] [2020-11-29 20:39:36,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0,QUANTIFIED] Derived loop invariant: ((((q == 2 && (((((((((1 <= y && r <= x) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && r <= x) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y))) && x == r + y * 2) && 2 * y <= x) || (((((((1 <= y && x <= 2) && 0 <= x) && a == 0) && r == x) && q == 0) && cond == 1) && b == 0)) || ((((q == 1 && x == r + y) && b <= y) && (((((((((1 <= y && r <= x) && x <= 2) && a == 2) && 1 <= cond) && (\exists ULTIMATE.start_main_~q~0 : int :: 2 * y + ULTIMATE.start_main_~q~0 * y <= 2 && 0 <= ULTIMATE.start_main_~q~0 * y)) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && r <= x) && x <= 2) && a == 1) && 1 == cond) && 0 <= x) && cond == 1) && b == y))) && r < y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.4s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 236 SDtfs, 619 SDslu, 371 SDs, 0 SdLazy, 819 SolverSat, 162 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 87 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 30 NumberOfFragments, 981 HoareAnnotationTreeSize, 10 FomulaSimplifications, 2064 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 332 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 187 ConstructedInterpolants, 7 QuantifiedInterpolants, 40227 SizeOfPredicates, 67 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 21/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...