./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:55:42,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:55:42,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:55:42,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:55:42,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:55:42,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:55:42,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:55:42,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:55:42,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:55:42,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:55:42,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:55:42,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:55:42,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:55:42,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:55:42,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:55:42,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:55:42,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:55:42,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:55:42,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:55:42,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:55:42,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:55:42,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:55:42,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:55:42,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:55:42,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:55:42,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:55:42,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:55:42,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:55:42,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:55:42,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:55:42,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:55:42,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:55:42,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:55:42,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:55:42,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:55:42,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:55:42,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:55:42,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:55:42,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:55:42,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:55:42,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:55:42,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:55:42,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:55:42,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:55:42,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:55:42,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:55:42,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:55:42,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:55:42,516 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:55:42,516 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:55:42,516 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:55:42,517 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:55:42,517 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:55:42,517 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:55:42,517 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:55:42,518 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:55:42,518 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:55:42,518 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:55:42,518 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:55:42,518 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:55:42,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:55:42,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:55:42,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:55:42,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:55:42,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:55:42,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:55:42,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:55:42,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:55:42,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:55:42,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:55:42,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:55:42,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:55:42,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:55:42,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:55:42,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:55:42,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:55:42,523 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:55:42,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:55:42,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:55:42,524 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:55:42,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:55:42,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:55:42,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:55:42,524 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_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/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_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2022-11-19 06:55:42,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:55:42,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:55:42,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:55:42,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:55:42,823 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:55:42,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-11-19 06:55:42,911 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/data/0dc1590dc/0c8df486440b4df29b998ecf7b76c9a9/FLAGf8bcfc0fa [2022-11-19 06:55:43,387 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:55:43,388 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-11-19 06:55:43,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/data/0dc1590dc/0c8df486440b4df29b998ecf7b76c9a9/FLAGf8bcfc0fa [2022-11-19 06:55:43,774 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/data/0dc1590dc/0c8df486440b4df29b998ecf7b76c9a9 [2022-11-19 06:55:43,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:55:43,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:55:43,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:55:43,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:55:43,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:55:43,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:55:43" (1/1) ... [2022-11-19 06:55:43,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7671a8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:43, skipping insertion in model container [2022-11-19 06:55:43,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:55:43" (1/1) ... [2022-11-19 06:55:43,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:55:43,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:55:44,019 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-11-19 06:55:44,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:55:44,069 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:55:44,091 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-11-19 06:55:44,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:55:44,125 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:55:44,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44 WrapperNode [2022-11-19 06:55:44,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:55:44,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:55:44,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:55:44,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:55:44,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,168 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-19 06:55:44,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:55:44,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:55:44,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:55:44,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:55:44,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:55:44,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:55:44,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:55:44,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:55:44,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (1/1) ... [2022-11-19 06:55:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:55:44,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:44,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:55:44,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:55:44,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:55:44,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:55:44,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:55:44,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:55:44,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 06:55:44,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 06:55:44,375 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:55:44,377 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:55:44,509 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:55:44,551 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:55:44,551 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 06:55:44,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:55:44 BoogieIcfgContainer [2022-11-19 06:55:44,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:55:44,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:55:44,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:55:44,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:55:44,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:55:43" (1/3) ... [2022-11-19 06:55:44,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664e946d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:55:44, skipping insertion in model container [2022-11-19 06:55:44,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:44" (2/3) ... [2022-11-19 06:55:44,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664e946d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:55:44, skipping insertion in model container [2022-11-19 06:55:44,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:55:44" (3/3) ... [2022-11-19 06:55:44,575 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2022-11-19 06:55:44,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:55:44,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 06:55:44,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:55:44,653 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71e38509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:55:44,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 06:55:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:55:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 06:55:44,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:44,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:44,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:55:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-11-19 06:55:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:55:44,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68555287] [2022-11-19 06:55:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:55:44,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:55:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838469279] [2022-11-19 06:55:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:44,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:44,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:55:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:44,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 06:55:44,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:45,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:55:45,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:55:45,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68555287] [2022-11-19 06:55:45,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:55:45,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838469279] [2022-11-19 06:55:45,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838469279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:55:45,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:55:45,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:55:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880159108] [2022-11-19 06:55:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:55:45,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:55:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:55:45,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:55:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:55:45,158 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:55:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:45,369 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-11-19 06:55:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:55:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 06:55:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:45,380 INFO L225 Difference]: With dead ends: 42 [2022-11-19 06:55:45,380 INFO L226 Difference]: Without dead ends: 21 [2022-11-19 06:55:45,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:55:45,387 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:45,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:55:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-19 06:55:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-19 06:55:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:55:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-19 06:55:45,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-11-19 06:55:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:45,430 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-19 06:55:45,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:55:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-19 06:55:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:55:45,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:45,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:45,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:45,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:45,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:55:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-11-19 06:55:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:55:45,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789435218] [2022-11-19 06:55:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:55:45,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:55:45,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779797906] [2022-11-19 06:55:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:45,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:45,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:55:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:45,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 06:55:45,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:46,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:47,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:55:47,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789435218] [2022-11-19 06:55:47,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:55:47,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779797906] [2022-11-19 06:55:47,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779797906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:55:47,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748015812] [2022-11-19 06:55:47,184 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-19 06:55:47,184 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:55:47,189 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:55:47,195 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:55:47,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:55:48,011 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-11-19 06:55:48,095 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:55:50,766 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '230#(and (< ~counter~0 101) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 06:55:50,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:55:50,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:55:50,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-19 06:55:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615964015] [2022-11-19 06:55:50,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:55:50,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 06:55:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:55:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 06:55:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2022-11-19 06:55:50,771 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:55:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:51,483 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-11-19 06:55:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 06:55:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-11-19 06:55:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:51,485 INFO L225 Difference]: With dead ends: 35 [2022-11-19 06:55:51,486 INFO L226 Difference]: Without dead ends: 31 [2022-11-19 06:55:51,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=122, Invalid=633, Unknown=1, NotChecked=0, Total=756 [2022-11-19 06:55:51,488 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:51,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 34 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:55:51,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-19 06:55:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-11-19 06:55:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:55:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-19 06:55:51,501 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-11-19 06:55:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:51,501 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-19 06:55:51,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:55:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-19 06:55:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 06:55:51,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:51,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:51,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:51,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-19 06:55:51,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:55:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-11-19 06:55:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:55:51,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814489979] [2022-11-19 06:55:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:55:51,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:55:51,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050488648] [2022-11-19 06:55:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:51,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:51,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:51,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:55:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:51,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:55:51,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:51,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:51,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:55:51,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814489979] [2022-11-19 06:55:51,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:55:51,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050488648] [2022-11-19 06:55:51,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050488648] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:55:51,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42992644] [2022-11-19 06:55:51,901 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:55:51,902 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:55:51,902 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:55:51,903 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:55:51,903 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:55:52,537 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 06:55:52,777 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:56:04,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '423#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:56:04,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:56:04,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:56:04,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-19 06:56:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001877994] [2022-11-19 06:56:04,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:04,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:56:04,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:56:04,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:56:04,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=252, Unknown=4, NotChecked=0, Total=306 [2022-11-19 06:56:04,860 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:56:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:05,035 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-11-19 06:56:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 06:56:05,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-19 06:56:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:05,037 INFO L225 Difference]: With dead ends: 59 [2022-11-19 06:56:05,037 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 06:56:05,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=70, Invalid=346, Unknown=4, NotChecked=0, Total=420 [2022-11-19 06:56:05,039 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:05,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 68 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:56:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 06:56:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-11-19 06:56:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:56:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-11-19 06:56:05,059 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-11-19 06:56:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:05,059 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-11-19 06:56:05,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:56:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-11-19 06:56:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:56:05,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:05,061 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:56:05,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:05,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:05,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:56:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-11-19 06:56:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:56:05,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865074279] [2022-11-19 06:56:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:56:05,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:56:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852446781] [2022-11-19 06:56:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:05,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:05,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:56:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:05,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-19 06:56:05,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 06:56:06,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 06:56:06,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:56:06,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865074279] [2022-11-19 06:56:06,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:56:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852446781] [2022-11-19 06:56:06,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852446781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416899988] [2022-11-19 06:56:06,743 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:56:06,743 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:56:06,743 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:56:06,744 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:56:06,744 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:56:07,264 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-11-19 06:56:07,428 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:56:15,297 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 86 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 06:56:21,724 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '720#(and (<= 0 |#NULL.base|) (< ~counter~0 101) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:56:21,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:56:21,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:56:21,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2022-11-19 06:56:21,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761276106] [2022-11-19 06:56:21,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:21,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 06:56:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:56:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 06:56:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=707, Unknown=2, NotChecked=0, Total=812 [2022-11-19 06:56:21,728 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:56:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:22,827 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-11-19 06:56:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 06:56:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2022-11-19 06:56:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:22,829 INFO L225 Difference]: With dead ends: 49 [2022-11-19 06:56:22,829 INFO L226 Difference]: Without dead ends: 41 [2022-11-19 06:56:22,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=190, Invalid=1214, Unknown=2, NotChecked=0, Total=1406 [2022-11-19 06:56:22,832 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:22,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 58 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 06:56:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-19 06:56:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-19 06:56:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:56:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-11-19 06:56:22,851 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-11-19 06:56:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:22,852 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-11-19 06:56:22,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:56:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-11-19 06:56:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 06:56:22,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:22,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-19 06:56:22,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:23,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:23,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:56:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-11-19 06:56:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:56:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606963333] [2022-11-19 06:56:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:56:23,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:56:23,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324460164] [2022-11-19 06:56:23,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:56:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:23,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:23,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:56:23,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-19 06:56:23,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:56:23,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 06:56:23,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:56:23,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 06:56:23,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:56:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606963333] [2022-11-19 06:56:23,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:56:23,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324460164] [2022-11-19 06:56:23,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324460164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:23,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271592256] [2022-11-19 06:56:23,551 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:56:23,552 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:56:23,552 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:56:23,553 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:56:23,553 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:56:24,061 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 06:56:24,222 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:56:25,463 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1119#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:56:25,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:56:25,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:56:25,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-19 06:56:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394626549] [2022-11-19 06:56:25,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:25,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 06:56:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:56:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 06:56:25,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-11-19 06:56:25,466 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-19 06:56:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:25,926 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-11-19 06:56:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 06:56:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2022-11-19 06:56:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:25,934 INFO L225 Difference]: With dead ends: 95 [2022-11-19 06:56:25,934 INFO L226 Difference]: Without dead ends: 89 [2022-11-19 06:56:25,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2022-11-19 06:56:25,936 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 100 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:25,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 92 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:56:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-19 06:56:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-19 06:56:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 06:56:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-11-19 06:56:25,970 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-11-19 06:56:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:25,970 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-11-19 06:56:25,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-19 06:56:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-11-19 06:56:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-19 06:56:25,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:25,973 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-19 06:56:25,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:26,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:26,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:56:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-11-19 06:56:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:56:26,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730276322] [2022-11-19 06:56:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:56:26,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:56:26,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024711212] [2022-11-19 06:56:26,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:56:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:26,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:26,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:26,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:56:26,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:56:26,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:56:26,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-19 06:56:26,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:56:26,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-19 06:56:27,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:56:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730276322] [2022-11-19 06:56:27,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:56:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024711212] [2022-11-19 06:56:27,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024711212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:27,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [696198833] [2022-11-19 06:56:27,242 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:56:27,242 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:56:27,242 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:56:27,243 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:56:27,243 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:56:27,726 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 06:56:27,897 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:56:38,789 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1947#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:56:38,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:56:38,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:56:38,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-19 06:56:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033634767] [2022-11-19 06:56:38,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:38,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 06:56:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:56:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 06:56:38,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2022-11-19 06:56:38,792 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:56:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:40,074 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-11-19 06:56:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-19 06:56:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 88 [2022-11-19 06:56:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:40,077 INFO L225 Difference]: With dead ends: 191 [2022-11-19 06:56:40,077 INFO L226 Difference]: Without dead ends: 185 [2022-11-19 06:56:40,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2022-11-19 06:56:40,082 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 127 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:40,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 182 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 06:56:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-19 06:56:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-19 06:56:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 139 states have (on average 1.0071942446043165) internal successors, (140), 139 states have internal predecessors, (140), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-19 06:56:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-11-19 06:56:40,150 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-11-19 06:56:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:40,150 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-11-19 06:56:40,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:56:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-11-19 06:56:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-19 06:56:40,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:40,157 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-11-19 06:56:40,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:40,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 06:56:40,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:56:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-11-19 06:56:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:56:40,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547548289] [2022-11-19 06:56:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:56:40,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:56:40,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494553381] [2022-11-19 06:56:40,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 06:56:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:40,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:40,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:56:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:40,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-19 06:56:40,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:56:41,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-11-19 06:56:43,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:56:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547548289] [2022-11-19 06:56:43,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:56:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494553381] [2022-11-19 06:56:43,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494553381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2082195863] [2022-11-19 06:56:43,414 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:56:43,414 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:56:43,415 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:56:43,415 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:56:43,415 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:56:43,885 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 06:56:44,024 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:56:45,929 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3663#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:56:45,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:56:45,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:56:45,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-19 06:56:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181123183] [2022-11-19 06:56:45,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:45,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-19 06:56:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:56:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-19 06:56:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=2375, Unknown=0, NotChecked=0, Total=3540 [2022-11-19 06:56:45,934 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-19 06:56:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:49,291 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-11-19 06:56:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-19 06:56:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 184 [2022-11-19 06:56:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:49,296 INFO L225 Difference]: With dead ends: 383 [2022-11-19 06:56:49,296 INFO L226 Difference]: Without dead ends: 377 [2022-11-19 06:56:49,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3348, Invalid=7572, Unknown=0, NotChecked=0, Total=10920 [2022-11-19 06:56:49,301 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 577 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:49,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 278 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-19 06:56:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-19 06:56:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-19 06:56:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 283 states have (on average 1.0035335689045937) internal successors, (284), 283 states have internal predecessors, (284), 47 states have call successors, (47), 47 states have call predecessors, (47), 46 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 06:56:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-11-19 06:56:49,419 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-11-19 06:56:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:49,420 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-11-19 06:56:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-19 06:56:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-11-19 06:56:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-19 06:56:49,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:49,435 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-11-19 06:56:49,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:49,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 06:56:49,642 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:56:49,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-11-19 06:56:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:56:49,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049583105] [2022-11-19 06:56:49,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:49,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:56:49,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:56:49,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567788486] [2022-11-19 06:56:49,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:56:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:49,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:49,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:57:39,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-19 06:57:39,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:57:39,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-19 06:57:39,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:57:42,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:57:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-11-19 06:57:48,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:48,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049583105] [2022-11-19 06:57:48,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:57:48,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567788486] [2022-11-19 06:57:48,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567788486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:57:48,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807698244] [2022-11-19 06:57:48,125 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:57:48,125 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:57:48,125 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:57:48,126 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:57:48,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:57:48,531 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 06:57:48,648 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:57:51,089 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7155#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:57:51,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:57:51,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:57:51,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-19 06:57:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453862126] [2022-11-19 06:57:51,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:57:51,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-19 06:57:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-19 06:57:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4597, Invalid=6959, Unknown=0, NotChecked=0, Total=11556 [2022-11-19 06:57:51,099 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand has 98 states, 98 states have (on average 4.357142857142857) internal successors, (427), 98 states have internal predecessors, (427), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-19 06:58:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:58:00,331 INFO L93 Difference]: Finished difference Result 767 states and 814 transitions. [2022-11-19 06:58:00,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-19 06:58:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.357142857142857) internal successors, (427), 98 states have internal predecessors, (427), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Word has length 376 [2022-11-19 06:58:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:58:00,337 INFO L225 Difference]: With dead ends: 767 [2022-11-19 06:58:00,337 INFO L226 Difference]: Without dead ends: 761 [2022-11-19 06:58:00,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=13572, Invalid=26628, Unknown=0, NotChecked=0, Total=40200 [2022-11-19 06:58:00,346 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 958 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:58:00,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 650 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-19 06:58:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-19 06:58:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-11-19 06:58:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 571 states have (on average 1.001751313485114) internal successors, (572), 571 states have internal predecessors, (572), 95 states have call successors, (95), 95 states have call predecessors, (95), 94 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2022-11-19 06:58:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 761 transitions. [2022-11-19 06:58:00,506 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 761 transitions. Word has length 376 [2022-11-19 06:58:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:58:00,507 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 761 transitions. [2022-11-19 06:58:00,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.357142857142857) internal successors, (427), 98 states have internal predecessors, (427), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-19 06:58:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 761 transitions. [2022-11-19 06:58:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2022-11-19 06:58:00,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:58:00,533 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2022-11-19 06:58:00,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:58:00,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:00,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:58:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:58:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1094369733, now seen corresponding path program 6 times [2022-11-19 06:58:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:58:00,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318304178] [2022-11-19 06:58:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:58:00,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:58:00,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206468828] [2022-11-19 06:58:00,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:58:00,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:00,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:58:00,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:58:00,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:58:02,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:58:02,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:58:02,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-19 06:58:02,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:58:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 188 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:58:10,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:58:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 188 proven. 17672 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2022-11-19 06:58:18,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:58:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318304178] [2022-11-19 06:58:18,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:58:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206468828] [2022-11-19 06:58:18,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206468828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:58:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2102659126] [2022-11-19 06:58:18,813 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:58:18,814 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:58:18,814 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:58:18,814 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:58:18,814 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:58:19,207 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 06:58:19,322 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:58:29,436 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14109#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:58:29,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:58:29,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:58:29,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-19 06:58:29,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521159316] [2022-11-19 06:58:29,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:58:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-19 06:58:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:58:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-19 06:58:29,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5187, Invalid=7692, Unknown=3, NotChecked=0, Total=12882 [2022-11-19 06:58:29,445 INFO L87 Difference]: Start difference. First operand 761 states and 761 transitions. Second operand has 104 states, 104 states have (on average 5.6923076923076925) internal successors, (592), 104 states have internal predecessors, (592), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2022-11-19 06:58:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:58:42,679 INFO L93 Difference]: Finished difference Result 815 states and 820 transitions. [2022-11-19 06:58:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-19 06:58:42,682 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.6923076923076925) internal successors, (592), 104 states have internal predecessors, (592), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) Word has length 760 [2022-11-19 06:58:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:58:42,687 INFO L225 Difference]: With dead ends: 815 [2022-11-19 06:58:42,687 INFO L226 Difference]: Without dead ends: 809 [2022-11-19 06:58:42,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2377 GetRequests, 2076 SyntacticMatches, 90 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11256 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=15380, Invalid=29773, Unknown=3, NotChecked=0, Total=45156 [2022-11-19 06:58:42,694 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 314 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-19 06:58:42,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 554 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-19 06:58:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-19 06:58:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2022-11-19 06:58:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 607 states have (on average 1.00164744645799) internal successors, (608), 607 states have internal predecessors, (608), 101 states have call successors, (101), 101 states have call predecessors, (101), 100 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-19 06:58:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 809 transitions. [2022-11-19 06:58:42,854 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 809 transitions. Word has length 760 [2022-11-19 06:58:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:58:42,856 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 809 transitions. [2022-11-19 06:58:42,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.6923076923076925) internal successors, (592), 104 states have internal predecessors, (592), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2022-11-19 06:58:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 809 transitions. [2022-11-19 06:58:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2022-11-19 06:58:42,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:58:42,865 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2022-11-19 06:58:42,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:58:43,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:43,066 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:58:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:58:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1577450477, now seen corresponding path program 7 times [2022-11-19 06:58:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:58:43,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349455679] [2022-11-19 06:58:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:58:43,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 06:58:43,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315091421] [2022-11-19 06:58:43,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 06:58:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:58:43,135 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:58:43,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:58:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:58:49,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 06:59:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:59:00,693 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 06:59:00,694 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 06:59:00,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 06:59:00,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 06:59:00,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 06:59:00,903 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-11-19 06:59:00,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:59:01,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:59:01 BoogieIcfgContainer [2022-11-19 06:59:01,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:59:01,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:59:01,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:59:01,163 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:59:01,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:55:44" (3/4) ... [2022-11-19 06:59:01,166 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 06:59:01,448 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:59:01,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:59:01,448 INFO L158 Benchmark]: Toolchain (without parser) took 197666.50ms. Allocated memory was 125.8MB in the beginning and 264.2MB in the end (delta: 138.4MB). Free memory was 89.6MB in the beginning and 97.0MB in the end (delta: -7.4MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,449 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 125.8MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:59:01,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.74ms. Allocated memory is still 125.8MB. Free memory was 89.4MB in the beginning and 101.9MB in the end (delta: -12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.88ms. Allocated memory is still 125.8MB. Free memory was 101.9MB in the beginning and 100.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,450 INFO L158 Benchmark]: Boogie Preprocessor took 38.96ms. Allocated memory is still 125.8MB. Free memory was 100.2MB in the beginning and 99.2MB in the end (delta: 967.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,450 INFO L158 Benchmark]: RCFGBuilder took 344.27ms. Allocated memory is still 125.8MB. Free memory was 99.2MB in the beginning and 86.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,451 INFO L158 Benchmark]: TraceAbstraction took 196607.06ms. Allocated memory was 125.8MB in the beginning and 264.2MB in the end (delta: 138.4MB). Free memory was 86.1MB in the beginning and 133.6MB in the end (delta: -47.5MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,452 INFO L158 Benchmark]: Witness Printer took 284.95ms. Allocated memory is still 264.2MB. Free memory was 133.6MB in the beginning and 97.0MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-19 06:59:01,455 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.26ms. Allocated memory is still 125.8MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.74ms. Allocated memory is still 125.8MB. Free memory was 89.4MB in the beginning and 101.9MB in the end (delta: -12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.88ms. Allocated memory is still 125.8MB. Free memory was 101.9MB in the beginning and 100.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.96ms. Allocated memory is still 125.8MB. Free memory was 100.2MB in the beginning and 99.2MB in the end (delta: 967.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.27ms. Allocated memory is still 125.8MB. Free memory was 99.2MB in the beginning and 86.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 196607.06ms. Allocated memory was 125.8MB in the beginning and 264.2MB in the end (delta: 138.4MB). Free memory was 86.1MB in the beginning and 133.6MB in the end (delta: -47.5MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. * Witness Printer took 284.95ms. Allocated memory is still 264.2MB. Free memory was 133.6MB in the beginning and 97.0MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=941362687, x=0, X=2147483647, y=0, Y=1544423167] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=941362687, X=2147483647, x=0, Y=1544423167, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=941362687, X=2147483647, x=0, x=0, x=0, Y=1544423167, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=941362687, x=0, x=0, x=0, X=2147483647, y=0, Y=1544423167] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=1, v=-264758273, x=0, X=2147483647, x=0, x=1, Y=1544423167, y=1, y++=124] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-264758273, x=0, X=2147483647, x=0, x=1, y=1, Y=1544423167, y++=124] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-264758273, X=2147483647, x=2147483647, x=1544423167, x=1, y=1, Y=1544423167, y++=124] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-264758273, X=2147483647, x=1544423167, x=2147483647, x=1, Y=1544423167, y=1, y++=124] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=2, v=2824088061, X=2147483647, x=2, x=1544423167, x=2147483647, y=1, Y=1544423167, y++=124] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=2824088061, x=2, X=2147483647, x=1544423167, x=2147483647, Y=1544423167, y=1, y++=124] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=2824088061, x=2147483647, x=2, X=2147483647, x=3088846334, y=1, Y=1544423167, y++=124] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=2824088061, x=2147483647, X=2147483647, x=3088846334, x=2, y=1, Y=1544423167, y++=124] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=3, v=1617967101, x=2147483647, X=2147483647, x=3088846334, x=3, y=2, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=1617967101, x=3, x=2147483647, X=2147483647, x=3088846334, y=2, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=1617967101, x=4294967294, X=2147483647, x=3, x=4633269501, Y=1544423167, y=2, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=1617967101, x=3, x=4294967294, X=2147483647, x=4633269501, y=2, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=4, v=411846141, x=4, X=2147483647, x=4294967294, x=4633269501, y=3, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=411846141, x=4633269501, x=4, X=2147483647, x=4294967294, Y=1544423167, y=3, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=411846141, x=6177692668, x=4, X=2147483647, x=6442450941, y=3, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=411846141, x=4, x=6442450941, X=2147483647, x=6177692668, Y=1544423167, y=3, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=5, v=-794274819, X=2147483647, x=6177692668, x=6442450941, x=5, y=4, Y=1544423167, y++=154] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-794274819, x=6177692668, x=5, x=6442450941, X=2147483647, y=4, Y=1544423167, y++=154] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-794274819, X=2147483647, x=8589934588, x=7722115835, x=5, y=4, Y=1544423167, y++=154] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-794274819, x=5, x=8589934588, X=2147483647, x=7722115835, Y=1544423167, y=4, y++=154] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=6, v=2294571515, x=8589934588, x=6, X=2147483647, x=7722115835, y=4, Y=1544423167, y++=154] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=2294571515, X=2147483647, x=6, x=7722115835, x=8589934588, Y=1544423167, y=4, y++=154] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=2294571515, X=2147483647, x=9266539002, x=8589934588, x=6, y=4, Y=1544423167, y++=154] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=2294571515, x=9266539002, x=8589934588, x=6, X=2147483647, Y=1544423167, y=4, y++=154] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=7, v=1088450555, X=2147483647, x=7, x=8589934588, x=9266539002, y=5, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=1088450555, x=8589934588, x=7, x=9266539002, X=2147483647, Y=1544423167, y=5, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=1088450555, x=10810962169, x=10737418235, X=2147483647, x=7, y=5, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=1088450555, X=2147483647, x=10737418235, x=7, x=10810962169, y=5, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=8, v=-117670405, x=8, x=10737418235, X=2147483647, x=10810962169, y=6, Y=1544423167, y++=179] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-117670405, x=8, X=2147483647, x=10810962169, x=10737418235, y=6, Y=1544423167, y++=179] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-117670405, x=12355385336, x=8, x=12884901882, X=2147483647, Y=1544423167, y=6, y++=179] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-117670405, X=2147483647, x=12355385336, x=8, x=12884901882, Y=1544423167, y=6, y++=179] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=9, v=2971175929, X=2147483647, x=12355385336, x=9, x=12884901882, y=6, Y=1544423167, y++=179] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=2971175929, x=12884901882, x=12355385336, X=2147483647, x=9, Y=1544423167, y=6, y++=179] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=2971175929, x=13899808503, x=9, x=12884901882, X=2147483647, Y=1544423167, y=6, y++=179] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=2971175929, X=2147483647, x=13899808503, x=9, x=12884901882, y=6, Y=1544423167, y++=179] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=10, v=1765054969, x=13899808503, x=12884901882, x=10, X=2147483647, y=7, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=1765054969, X=2147483647, x=12884901882, x=13899808503, x=10, Y=1544423167, y=7, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=1765054969, x=10, x=15444231670, x=15032385529, X=2147483647, Y=1544423167, y=7, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=1765054969, x=10, x=15444231670, x=15032385529, X=2147483647, y=7, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=11, v=558934009, x=15032385529, x=11, X=2147483647, x=15444231670, Y=1544423167, y=8, y++=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=558934009, x=11, x=15444231670, x=15032385529, X=2147483647, Y=1544423167, y=8, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=558934009, x=16988654837, x=17179869176, x=11, X=2147483647, y=8, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=558934009, x=11, X=2147483647, x=17179869176, x=16988654837, y=8, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=12, v=-647186951, X=2147483647, x=16988654837, x=17179869176, x=12, y=9, Y=1544423167, y++=210] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-647186951, x=17179869176, X=2147483647, x=12, x=16988654837, y=9, Y=1544423167, y++=210] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-647186951, X=2147483647, x=12, x=18533078004, x=19327352823, y=9, Y=1544423167, y++=210] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-647186951, x=19327352823, x=18533078004, x=12, X=2147483647, y=9, Y=1544423167, y++=210] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=13, v=2441659383, X=2147483647, x=18533078004, x=19327352823, x=13, y=9, Y=1544423167, y++=210] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=2441659383, x=13, x=19327352823, x=18533078004, X=2147483647, Y=1544423167, y=9, y++=210] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=2441659383, x=19327352823, x=13, X=2147483647, x=20077501171, Y=1544423167, y=9, y++=210] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=2441659383, x=20077501171, x=19327352823, X=2147483647, x=13, Y=1544423167, y=9, y++=210] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=14, v=1235538423, X=2147483647, x=19327352823, x=20077501171, x=14, Y=1544423167, y=10, y++=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=1235538423, x=19327352823, X=2147483647, x=20077501171, x=14, Y=1544423167, y=10, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=1235538423, x=14, x=21621924338, x=21474836470, X=2147483647, y=10, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=1235538423, x=21621924338, X=2147483647, x=21474836470, x=14, y=10, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=15, v=29417463, X=2147483647, x=15, x=21474836470, x=21621924338, Y=1544423167, y=11, y++=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=29417463, X=2147483647, x=21474836470, x=21621924338, x=15, Y=1544423167, y=11, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=29417463, x=15, X=2147483647, x=23622320117, x=23166347505, y=11, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=29417463, X=2147483647, x=15, x=23166347505, x=23622320117, Y=1544423167, y=11, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=16, v=-1176703497, x=16, x=23622320117, x=23166347505, X=2147483647, Y=1544423167, y=12, y++=242] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-1176703497, x=23622320117, x=23166347505, X=2147483647, x=16, y=12, Y=1544423167, y++=242] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-1176703497, x=24710770672, x=16, x=25769803764, X=2147483647, y=12, Y=1544423167, y++=242] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-1176703497, X=2147483647, x=25769803764, x=24710770672, x=16, Y=1544423167, y=12, y++=242] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=17, v=1912142837, X=2147483647, x=24710770672, x=17, x=25769803764, y=12, Y=1544423167, y++=242] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=1912142837, x=24710770672, X=2147483647, x=25769803764, x=17, Y=1544423167, y=12, y++=242] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=1912142837, x=25769803764, x=17, x=26255193839, X=2147483647, y=12, Y=1544423167, y++=242] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=1912142837, x=26255193839, x=25769803764, X=2147483647, x=17, Y=1544423167, y=12, y++=242] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=18, v=706021877, x=18, x=25769803764, X=2147483647, x=26255193839, Y=1544423167, y=13, y++=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=706021877, X=2147483647, x=26255193839, x=25769803764, x=18, Y=1544423167, y=13, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=706021877, x=27799617006, x=27917287411, X=2147483647, x=18, Y=1544423167, y=13, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=706021877, x=27917287411, x=27799617006, X=2147483647, x=18, Y=1544423167, y=13, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=19, v=-500099083, x=27799617006, x=27917287411, x=19, X=2147483647, y=14, Y=1544423167, y++=268] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-500099083, x=19, x=27799617006, X=2147483647, x=27917287411, Y=1544423167, y=14, y++=268] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-500099083, x=29344040173, X=2147483647, x=30064771058, x=19, Y=1544423167, y=14, y++=268] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-500099083, x=19, x=30064771058, x=29344040173, X=2147483647, Y=1544423167, y=14, y++=268] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=20, v=2588747251, x=20, X=2147483647, x=30064771058, x=29344040173, y=14, Y=1544423167, y++=268] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=2588747251, x=30064771058, X=2147483647, x=29344040173, x=20, y=14, Y=1544423167, y++=268] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=2588747251, X=2147483647, x=30064771058, x=30888463340, x=20, y=14, Y=1544423167, y++=268] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=2588747251, x=30888463340, x=30064771058, x=20, X=2147483647, y=14, Y=1544423167, y++=268] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=21, v=1382626291, x=30064771058, X=2147483647, x=21, x=30888463340, Y=1544423167, y=15, y++=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=1382626291, X=2147483647, x=30888463340, x=30064771058, x=21, y=15, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=1382626291, x=32432886507, x=21, x=32212254705, X=2147483647, Y=1544423167, y=15, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=1382626291, X=2147483647, x=32212254705, x=21, x=32432886507, y=15, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=22, v=176505331, x=32432886507, x=32212254705, x=22, X=2147483647, y=16, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=176505331, X=2147483647, x=32432886507, x=22, x=32212254705, Y=1544423167, y=16, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=176505331, x=34359738352, x=22, X=2147483647, x=33977309674, Y=1544423167, y=16, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=176505331, X=2147483647, x=34359738352, x=22, x=33977309674, Y=1544423167, y=16, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=23, v=-1029615629, x=34359738352, x=23, X=2147483647, x=33977309674, y=17, Y=1544423167, y++=300] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-1029615629, x=33977309674, X=2147483647, x=34359738352, x=23, Y=1544423167, y=17, y++=300] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-1029615629, x=35521732841, x=23, X=2147483647, x=36507221999, Y=1544423167, y=17, y++=300] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-1029615629, X=2147483647, x=35521732841, x=23, x=36507221999, Y=1544423167, y=17, y++=300] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=24, v=2059230705, x=24, x=35521732841, X=2147483647, x=36507221999, Y=1544423167, y=17, y++=300] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=2059230705, x=24, x=35521732841, x=36507221999, X=2147483647, y=17, Y=1544423167, y++=300] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=2059230705, x=37066156008, x=24, X=2147483647, x=36507221999, Y=1544423167, y=17, y++=300] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=2059230705, x=37066156008, x=36507221999, x=24, X=2147483647, Y=1544423167, y=17, y++=300] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=25, v=853109745, x=37066156008, x=25, X=2147483647, x=36507221999, Y=1544423167, y=18, y++=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=853109745, X=2147483647, x=36507221999, x=37066156008, x=25, Y=1544423167, y=18, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=853109745, x=38610579175, x=25, X=2147483647, x=38654705646, y=18, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=853109745, X=2147483647, x=38610579175, x=38654705646, x=25, Y=1544423167, y=18, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=26, v=-353011215, x=26, x=38610579175, x=38654705646, X=2147483647, Y=1544423167, y=19, y++=326] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-353011215, X=2147483647, x=38610579175, x=26, x=38654705646, Y=1544423167, y=19, y++=326] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-353011215, X=2147483647, x=40802189293, x=40155002342, x=26, Y=1544423167, y=19, y++=326] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-353011215, x=40802189293, x=26, x=40155002342, X=2147483647, y=19, Y=1544423167, y++=326] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=27, v=2735835119, x=40155002342, x=40802189293, X=2147483647, x=27, Y=1544423167, y=19, y++=326] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=2735835119, X=2147483647, x=40155002342, x=27, x=40802189293, y=19, Y=1544423167, y++=326] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=2735835119, x=40802189293, x=41699425509, X=2147483647, x=27, y=19, Y=1544423167, y++=326] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=2735835119, x=41699425509, X=2147483647, x=27, x=40802189293, y=19, Y=1544423167, y++=326] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=28, v=1529714159, x=40802189293, x=28, X=2147483647, x=41699425509, Y=1544423167, y=20, y++=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=1529714159, x=40802189293, x=41699425509, x=28, X=2147483647, Y=1544423167, y=20, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=1529714159, x=28, X=2147483647, x=42949672940, x=43243848676, Y=1544423167, y=20, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=1529714159, x=28, x=42949672940, X=2147483647, x=43243848676, Y=1544423167, y=20, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=29, v=323593199, x=42949672940, X=2147483647, x=29, x=43243848676, Y=1544423167, y=21, y++=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=323593199, X=2147483647, x=42949672940, x=43243848676, x=29, y=21, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=323593199, x=45097156587, X=2147483647, x=29, x=44788271843, y=21, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=323593199, X=2147483647, x=44788271843, x=29, x=45097156587, Y=1544423167, y=21, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=30, v=-882527761, x=30, X=2147483647, x=44788271843, x=45097156587, Y=1544423167, y=22, y++=356] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-882527761, x=45097156587, x=30, X=2147483647, x=44788271843, y=22, Y=1544423167, y++=356] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-882527761, x=30, x=46332695010, x=47244640234, X=2147483647, y=22, Y=1544423167, y++=356] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-882527761, x=46332695010, x=30, X=2147483647, x=47244640234, Y=1544423167, y=22, y++=356] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=31, v=2206318573, x=31, x=47244640234, x=46332695010, X=2147483647, y=22, Y=1544423167, y++=356] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=2206318573, X=2147483647, x=47244640234, x=46332695010, x=31, y=22, Y=1544423167, y++=356] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=2206318573, x=47244640234, X=2147483647, x=47877118177, x=31, Y=1544423167, y=22, y++=356] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=2206318573, x=47244640234, x=31, X=2147483647, x=47877118177, Y=1544423167, y=22, y++=356] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=32, v=1000197613, X=2147483647, x=47244640234, x=32, x=47877118177, Y=1544423167, y=23, y++=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=1000197613, x=47244640234, X=2147483647, x=47877118177, x=32, y=23, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=1000197613, X=2147483647, x=32, x=49392123881, x=49421541344, y=23, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=1000197613, X=2147483647, x=49421541344, x=49392123881, x=32, y=23, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=33, v=-205923347, X=2147483647, x=33, x=49421541344, x=49392123881, Y=1544423167, y=24, y++=380] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-205923347, X=2147483647, x=49392123881, x=33, x=49421541344, y=24, Y=1544423167, y++=380] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-205923347, x=50965964511, x=51539607528, X=2147483647, x=33, y=24, Y=1544423167, y++=380] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-205923347, X=2147483647, x=50965964511, x=33, x=51539607528, Y=1544423167, y=24, y++=380] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=34, v=2882922987, x=51539607528, x=34, X=2147483647, x=50965964511, Y=1544423167, y=24, y++=380] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=2882922987, x=50965964511, X=2147483647, x=34, x=51539607528, y=24, Y=1544423167, y++=380] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=2882922987, x=52510387678, X=2147483647, x=51539607528, x=34, y=24, Y=1544423167, y++=380] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=2882922987, x=34, x=51539607528, X=2147483647, x=52510387678, Y=1544423167, y=24, y++=380] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=35, v=1676802027, x=35, x=51539607528, X=2147483647, x=52510387678, y=25, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=1676802027, x=35, X=2147483647, x=52510387678, x=51539607528, y=25, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=1676802027, x=35, x=53687091175, x=54054810845, X=2147483647, y=25, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=1676802027, x=54054810845, x=53687091175, x=35, X=2147483647, y=25, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=36, v=470681067, X=2147483647, x=36, x=53687091175, x=54054810845, y=26, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=470681067, x=54054810845, x=53687091175, X=2147483647, x=36, Y=1544423167, y=26, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=470681067, x=36, X=2147483647, x=55834574822, x=55599234012, Y=1544423167, y=26, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=470681067, x=55599234012, x=36, x=55834574822, X=2147483647, y=26, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=37, v=-735439893, x=55834574822, x=55599234012, x=37, X=2147483647, Y=1544423167, y=27, y++=412] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-735439893, x=55599234012, x=37, X=2147483647, x=55834574822, Y=1544423167, y=27, y++=412] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-735439893, x=57982058469, x=57143657179, x=37, X=2147483647, y=27, Y=1544423167, y++=412] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-735439893, x=37, x=57982058469, X=2147483647, x=57143657179, y=27, Y=1544423167, y++=412] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=38, v=2353406441, x=38, x=57982058469, x=57143657179, X=2147483647, Y=1544423167, y=27, y++=412] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=2353406441, X=2147483647, x=38, x=57143657179, x=57982058469, Y=1544423167, y=27, y++=412] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=2353406441, x=57982058469, x=38, X=2147483647, x=58688080346, y=27, Y=1544423167, y++=412] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=2353406441, x=57982058469, x=58688080346, x=38, X=2147483647, Y=1544423167, y=27, y++=412] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=39, v=1147285481, x=57982058469, X=2147483647, x=58688080346, x=39, y=28, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=1147285481, x=57982058469, x=39, x=58688080346, X=2147483647, Y=1544423167, y=28, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=1147285481, x=60129542116, x=60232503513, X=2147483647, x=39, Y=1544423167, y=28, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=1147285481, x=39, x=60232503513, x=60129542116, X=2147483647, y=28, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=40, v=-58835479, x=40, x=60232503513, X=2147483647, x=60129542116, y=29, Y=1544423167, y++=436] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-58835479, x=40, x=60232503513, x=60129542116, X=2147483647, y=29, Y=1544423167, y++=436] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-58835479, x=61776926680, x=62277025763, X=2147483647, x=40, Y=1544423167, y=29, y++=436] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-58835479, x=40, x=62277025763, X=2147483647, x=61776926680, Y=1544423167, y=29, y++=436] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=41, v=3030010855, x=61776926680, x=62277025763, X=2147483647, x=41, y=29, Y=1544423167, y++=436] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=3030010855, x=62277025763, X=2147483647, x=41, x=61776926680, y=29, Y=1544423167, y++=436] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=3030010855, x=41, x=62277025763, X=2147483647, x=63321349847, Y=1544423167, y=29, y++=436] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=3030010855, x=63321349847, x=62277025763, x=41, X=2147483647, Y=1544423167, y=29, y++=436] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=42, v=1823889895, X=2147483647, x=62277025763, x=42, x=63321349847, Y=1544423167, y=30, y++=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=1823889895, x=63321349847, x=62277025763, x=42, X=2147483647, y=30, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=1823889895, x=64865773014, X=2147483647, x=42, x=64424509410, Y=1544423167, y=30, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=1823889895, x=42, X=2147483647, x=64424509410, x=64865773014, y=30, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=43, v=617768935, x=43, x=64424509410, X=2147483647, x=64865773014, y=31, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=617768935, x=64865773014, x=43, x=64424509410, X=2147483647, Y=1544423167, y=31, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=617768935, X=2147483647, x=66571993057, x=43, x=66410196181, y=31, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=617768935, X=2147483647, x=66410196181, x=66571993057, x=43, Y=1544423167, y=31, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=44, v=-588352025, X=2147483647, x=66410196181, x=44, x=66571993057, y=32, Y=1544423167, y++=468] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-588352025, x=66571993057, x=66410196181, x=44, X=2147483647, y=32, Y=1544423167, y++=468] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-588352025, x=68719476704, X=2147483647, x=44, x=67954619348, Y=1544423167, y=32, y++=468] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-588352025, x=44, x=68719476704, x=67954619348, X=2147483647, y=32, Y=1544423167, y++=468] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=45, v=2500494309, x=68719476704, x=45, X=2147483647, x=67954619348, y=32, Y=1544423167, y++=468] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=2500494309, x=67954619348, x=45, X=2147483647, x=68719476704, Y=1544423167, y=32, y++=468] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=2500494309, x=69499042515, x=45, X=2147483647, x=68719476704, y=32, Y=1544423167, y++=468] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=2500494309, X=2147483647, x=45, x=68719476704, x=69499042515, Y=1544423167, y=32, y++=468] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=46, v=1294373349, x=46, X=2147483647, x=68719476704, x=69499042515, Y=1544423167, y=33, y++=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=1294373349, x=69499042515, X=2147483647, x=68719476704, x=46, Y=1544423167, y=33, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=1294373349, x=46, X=2147483647, x=71043465682, x=70866960351, y=33, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=1294373349, X=2147483647, x=46, x=70866960351, x=71043465682, y=33, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=47, v=88252389, x=71043465682, x=70866960351, x=47, X=2147483647, y=34, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=88252389, x=47, X=2147483647, x=70866960351, x=71043465682, y=34, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=88252389, x=73014443998, x=47, x=72587888849, X=2147483647, Y=1544423167, y=34, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=88252389, x=73014443998, x=72587888849, X=2147483647, x=47, y=34, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=48, v=-1117868571, X=2147483647, x=72587888849, x=48, x=73014443998, Y=1544423167, y=35, y++=500] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1117868571, X=2147483647, x=73014443998, x=72587888849, x=48, y=35, Y=1544423167, y++=500] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1117868571, x=74132312016, x=48, x=75161927645, X=2147483647, Y=1544423167, y=35, y++=500] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1117868571, x=75161927645, x=74132312016, X=2147483647, x=48, y=35, Y=1544423167, y++=500] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=49, v=1970977763, X=2147483647, x=74132312016, x=49, x=75161927645, Y=1544423167, y=35, y++=500] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=1970977763, x=74132312016, x=75161927645, x=49, X=2147483647, y=35, Y=1544423167, y++=500] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=1970977763, x=75161927645, x=49, X=2147483647, x=75676735183, y=35, Y=1544423167, y++=500] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=1970977763, x=75676735183, X=2147483647, x=75161927645, x=49, Y=1544423167, y=35, y++=500] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=50, v=764856803, x=75161927645, x=75676735183, x=50, X=2147483647, Y=1544423167, y=36, y++=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=764856803, x=50, x=75161927645, x=75676735183, X=2147483647, Y=1544423167, y=36, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=764856803, x=50, x=77309411292, X=2147483647, x=77221158350, Y=1544423167, y=36, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=51, v=764856803, x=77309411292, x=50, X=2147483647, x=77221158350, y=36, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=51, v=-441264157, x=77309411292, X=2147483647, x=77221158350, x=51, Y=1544423167, y=37, y++=527] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-441264157, x=77309411292, x=51, x=77221158350, X=2147483647, y=37, Y=1544423167, y++=527] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-441264157, x=51, X=2147483647, x=79456894939, x=78765581517, y=37, Y=1544423167, y++=527] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=52, v=-441264157, x=51, x=79456894939, x=78765581517, X=2147483647, Y=1544423167, y=37, y++=527] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=52, v=2647582177, x=78765581517, X=2147483647, x=79456894939, x=52, Y=1544423167, y=37, y++=527] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=2647582177, X=2147483647, x=52, x=79456894939, x=78765581517, Y=1544423167, y=37, y++=527] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=2647582177, x=52, X=2147483647, x=80310004684, x=79456894939, y=37, Y=1544423167, y++=527] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=53, v=2647582177, x=79456894939, x=52, x=80310004684, X=2147483647, y=37, Y=1544423167, y++=527] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=53, v=1441461217, x=79456894939, x=53, x=80310004684, X=2147483647, y=38, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=1441461217, x=80310004684, x=53, X=2147483647, x=79456894939, Y=1544423167, y=38, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=1441461217, x=81604378586, X=2147483647, x=81854427851, x=53, Y=1544423167, y=38, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=54, v=1441461217, x=81604378586, x=81854427851, X=2147483647, x=53, y=38, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=54, v=235340257, X=2147483647, x=81604378586, x=81854427851, x=54, Y=1544423167, y=39, y++=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=235340257, x=54, x=81604378586, X=2147483647, x=81854427851, Y=1544423167, y=39, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=235340257, x=54, x=83751862233, X=2147483647, x=83398851018, Y=1544423167, y=39, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=55, v=235340257, X=2147483647, x=83398851018, x=54, x=83751862233, Y=1544423167, y=39, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=55, v=-970780703, x=55, x=83751862233, x=83398851018, X=2147483647, Y=1544423167, y=40, y++=559] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-970780703, x=83398851018, x=55, x=83751862233, X=2147483647, y=40, Y=1544423167, y++=559] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-970780703, x=84943274185, x=55, x=85899345880, X=2147483647, Y=1544423167, y=40, y++=559] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=56, v=-970780703, x=85899345880, x=55, x=84943274185, X=2147483647, y=40, Y=1544423167, y++=559] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=56, v=2118065631, X=2147483647, x=56, x=84943274185, x=85899345880, Y=1544423167, y=40, y++=559] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=2118065631, x=85899345880, x=56, X=2147483647, x=84943274185, y=40, Y=1544423167, y++=559] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=2118065631, x=56, x=85899345880, X=2147483647, x=86487697352, Y=1544423167, y=40, y++=559] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=57, v=2118065631, x=86487697352, x=85899345880, X=2147483647, x=56, Y=1544423167, y=40, y++=559] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=57, v=911944671, x=86487697352, x=85899345880, x=57, X=2147483647, Y=1544423167, y=41, y++=0] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=911944671, x=85899345880, X=2147483647, x=57, x=86487697352, Y=1544423167, y=41, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=911944671, x=88032120519, x=57, x=88046829527, X=2147483647, y=41, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=911944671, x=57, x=88046829527, X=2147483647, x=88032120519, Y=1544423167, y=41, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=58, v=-294176289, x=88032120519, x=58, X=2147483647, x=88046829527, Y=1544423167, y=42, y++=582] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-294176289, x=88046829527, X=2147483647, x=88032120519, x=58, y=42, Y=1544423167, y++=582] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-294176289, x=58, X=2147483647, x=89576543686, x=90194313174, Y=1544423167, y=42, y++=582] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=59, v=-294176289, X=2147483647, x=58, x=90194313174, x=89576543686, Y=1544423167, y=42, y++=582] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=59, v=2794670045, x=89576543686, x=59, x=90194313174, X=2147483647, Y=1544423167, y=42, y++=582] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=2794670045, X=2147483647, x=90194313174, x=59, x=89576543686, y=42, Y=1544423167, y++=582] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=2794670045, x=91120966853, X=2147483647, x=90194313174, x=59, y=42, Y=1544423167, y++=582] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=60, v=2794670045, X=2147483647, x=91120966853, x=59, x=90194313174, y=42, Y=1544423167, y++=582] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=60, v=1588549085, x=90194313174, x=91120966853, X=2147483647, x=60, Y=1544423167, y=43, y++=0] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=1588549085, x=90194313174, x=91120966853, X=2147483647, x=60, Y=1544423167, y=43, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=1588549085, X=2147483647, x=92665390020, x=60, x=92341796821, y=43, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=61, v=1588549085, x=92341796821, X=2147483647, x=92665390020, x=60, Y=1544423167, y=43, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=61, v=382428125, X=2147483647, x=61, x=92341796821, x=92665390020, Y=1544423167, y=44, y++=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=382428125, x=92341796821, x=92665390020, x=61, X=2147483647, y=44, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=382428125, x=94489280468, x=61, X=2147483647, x=94209813187, y=44, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=62, v=382428125, x=61, x=94489280468, X=2147483647, x=94209813187, y=44, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=62, v=-823692835, x=94489280468, x=62, x=94209813187, X=2147483647, Y=1544423167, y=45, y++=615] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-823692835, x=94209813187, X=2147483647, x=62, x=94489280468, Y=1544423167, y=45, y++=615] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-823692835, X=2147483647, x=96636764115, x=95754236354, x=62, Y=1544423167, y=45, y++=615] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=63, v=-823692835, x=62, x=95754236354, x=96636764115, X=2147483647, Y=1544423167, y=45, y++=615] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=63, v=2265153499, x=95754236354, X=2147483647, x=96636764115, x=63, Y=1544423167, y=45, y++=615] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=2265153499, X=2147483647, x=63, x=95754236354, x=96636764115, y=45, Y=1544423167, y++=615] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=2265153499, x=96636764115, x=97298659521, X=2147483647, x=63, y=45, Y=1544423167, y++=615] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=64, v=2265153499, x=96636764115, X=2147483647, x=97298659521, x=63, Y=1544423167, y=45, y++=615] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=64, v=1059032539, x=96636764115, x=64, x=97298659521, X=2147483647, Y=1544423167, y=46, y++=0] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=1059032539, x=96636764115, x=97298659521, X=2147483647, x=64, y=46, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=1059032539, x=98843082688, x=98784247762, X=2147483647, x=64, Y=1544423167, y=46, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=65, v=1059032539, x=98784247762, X=2147483647, x=98843082688, x=64, Y=1544423167, y=46, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=65, v=-147088421, X=2147483647, x=98843082688, x=65, x=98784247762, Y=1544423167, y=47, y++=638] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-147088421, X=2147483647, x=65, x=98784247762, x=98843082688, Y=1544423167, y=47, y++=638] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-147088421, x=65, x=100931731409, x=100387505855, X=2147483647, y=47, Y=1544423167, y++=638] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=66, v=-147088421, x=100931731409, X=2147483647, x=100387505855, x=65, y=47, Y=1544423167, y++=638] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=66, v=2941757913, X=2147483647, x=100931731409, x=100387505855, x=66, Y=1544423167, y=47, y++=638] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=2941757913, X=2147483647, x=100931731409, x=66, x=100387505855, y=47, Y=1544423167, y++=638] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=2941757913, x=66, x=101931929022, X=2147483647, x=100931731409, Y=1544423167, y=47, y++=638] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=67, v=2941757913, x=66, X=2147483647, x=101931929022, x=100931731409, Y=1544423167, y=47, y++=638] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=67, v=1735636953, x=67, x=101931929022, x=100931731409, X=2147483647, Y=1544423167, y=48, y++=0] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=1735636953, X=2147483647, x=100931731409, x=67, x=101931929022, y=48, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=1735636953, X=2147483647, x=103476352189, x=67, x=103079215056, y=48, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=68, v=1735636953, x=103079215056, X=2147483647, x=67, x=103476352189, y=48, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=68, v=529515993, x=103476352189, x=68, X=2147483647, x=103079215056, Y=1544423167, y=49, y++=0] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=529515993, x=68, x=103476352189, X=2147483647, x=103079215056, Y=1544423167, y=49, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=529515993, x=68, x=105020775356, X=2147483647, x=105226698703, Y=1544423167, y=49, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=69, v=529515993, x=105020775356, X=2147483647, x=68, x=105226698703, y=49, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=69, v=-676604967, x=105226698703, X=2147483647, x=69, x=105020775356, y=50, Y=1544423167, y++=672] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-676604967, x=105226698703, x=69, x=105020775356, X=2147483647, y=50, Y=1544423167, y++=672] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-676604967, x=69, X=2147483647, x=106565198523, x=107374182350, Y=1544423167, y=50, y++=672] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=70, v=-676604967, x=69, X=2147483647, x=106565198523, x=107374182350, Y=1544423167, y=50, y++=672] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=70, v=2412241367, X=2147483647, x=106565198523, x=70, x=107374182350, Y=1544423167, y=50, y++=672] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=2412241367, X=2147483647, x=106565198523, x=107374182350, x=70, y=50, Y=1544423167, y++=672] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=2412241367, x=70, x=108109621690, x=107374182350, X=2147483647, y=50, Y=1544423167, y++=672] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=71, v=2412241367, X=2147483647, x=108109621690, x=107374182350, x=70, Y=1544423167, y=50, y++=672] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=71, v=1206120407, x=108109621690, X=2147483647, x=71, x=107374182350, Y=1544423167, y=51, y++=0] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=1206120407, X=2147483647, x=108109621690, x=71, x=107374182350, Y=1544423167, y=51, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=1206120407, x=109521665997, X=2147483647, x=109654044857, x=71, y=51, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=72, v=1206120407, x=109654044857, x=109521665997, x=71, X=2147483647, Y=1544423167, y=51, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=72, v=-553, x=72, X=2147483647, x=109521665997, x=109654044857, y=52, Y=1544423167, y++=695] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-553, X=2147483647, x=72, x=109654044857, x=109521665997, Y=1544423167, y=52, y++=695] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-553, x=111198468024, x=111669149644, X=2147483647, x=72, y=52, Y=1544423167, y++=695] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=73, v=-553, x=72, x=111198468024, X=2147483647, x=111669149644, y=52, Y=1544423167, y++=695] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=73, v=3088845781, x=73, x=111198468024, X=2147483647, x=111669149644, y=52, Y=1544423167, y++=695] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=3088845781, x=111669149644, x=73, x=111198468024, X=2147483647, Y=1544423167, y=52, y++=695] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=3088845781, x=73, X=2147483647, x=111669149644, x=112742891191, Y=1544423167, y=52, y++=695] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=74, v=3088845781, x=112742891191, X=2147483647, x=73, x=111669149644, y=52, Y=1544423167, y++=695] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=74, v=1882724821, x=112742891191, X=2147483647, x=111669149644, x=74, y=53, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=1882724821, x=111669149644, x=112742891191, X=2147483647, x=74, y=53, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=1882724821, x=74, x=113816633291, x=114287314358, X=2147483647, Y=1544423167, y=53, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=75, v=1882724821, x=114287314358, x=113816633291, x=74, X=2147483647, Y=1544423167, y=53, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=75, v=676603861, x=75, x=114287314358, X=2147483647, x=113816633291, y=54, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=676603861, X=2147483647, x=75, x=113816633291, x=114287314358, y=54, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=676603861, x=75, X=2147483647, x=115831737525, x=115964116938, Y=1544423167, y=54, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=76, v=676603861, x=115964116938, x=115831737525, x=75, X=2147483647, y=54, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=76, v=-529517099, x=76, x=115831737525, X=2147483647, x=115964116938, y=55, Y=1544423167, y++=728] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-529517099, x=115964116938, x=76, X=2147483647, x=115831737525, y=55, Y=1544423167, y++=728] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-529517099, x=76, x=118111600585, x=117376160692, X=2147483647, y=55, Y=1544423167, y++=728] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=77, v=-529517099, x=118111600585, x=76, X=2147483647, x=117376160692, y=55, Y=1544423167, y++=728] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=77, v=2559329235, x=117376160692, x=118111600585, X=2147483647, x=77, Y=1544423167, y=55, y++=728] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=2559329235, x=77, x=118111600585, X=2147483647, x=117376160692, y=55, Y=1544423167, y++=728] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=2559329235, x=77, x=118111600585, X=2147483647, x=118920583859, Y=1544423167, y=55, y++=728] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=78, v=2559329235, x=118920583859, x=77, x=118111600585, X=2147483647, y=55, Y=1544423167, y++=728] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=78, v=1353208275, X=2147483647, x=118111600585, x=78, x=118920583859, y=56, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=1353208275, x=118920583859, X=2147483647, x=118111600585, x=78, y=56, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=1353208275, x=120259084232, x=78, X=2147483647, x=120465007026, y=56, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=79, v=1353208275, X=2147483647, x=120259084232, x=78, x=120465007026, y=56, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=79, v=147087315, x=120259084232, x=120465007026, X=2147483647, x=79, y=57, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=147087315, x=120259084232, x=79, X=2147483647, x=120465007026, y=57, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=147087315, x=122009430193, X=2147483647, x=79, x=122406567879, Y=1544423167, y=57, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=80, v=147087315, x=79, x=122406567879, x=122009430193, X=2147483647, y=57, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=80, v=-1059033645, X=2147483647, x=80, x=122009430193, x=122406567879, y=58, Y=1544423167, y++=761] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-1059033645, x=80, X=2147483647, x=122009430193, x=122406567879, y=58, Y=1544423167, y++=761] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-1059033645, X=2147483647, x=80, x=124554051526, x=123553853360, y=58, Y=1544423167, y++=761] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=81, v=-1059033645, x=124554051526, x=123553853360, X=2147483647, x=80, y=58, Y=1544423167, y++=761] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=81, v=2029812689, x=124554051526, X=2147483647, x=81, x=123553853360, Y=1544423167, y=58, y++=761] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=2029812689, x=123553853360, x=124554051526, x=81, X=2147483647, y=58, Y=1544423167, y++=761] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=2029812689, X=2147483647, x=81, x=124554051526, x=125098276527, y=58, Y=1544423167, y++=761] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=82, v=2029812689, x=125098276527, X=2147483647, x=124554051526, x=81, Y=1544423167, y=58, y++=761] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=82, v=823691729, x=82, x=124554051526, x=125098276527, X=2147483647, y=59, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=823691729, x=82, X=2147483647, x=125098276527, x=124554051526, y=59, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=823691729, x=82, x=126701535173, X=2147483647, x=126642699694, y=59, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=83, v=823691729, x=126642699694, X=2147483647, x=126701535173, x=82, Y=1544423167, y=59, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=83, v=-382429231, x=83, x=126642699694, X=2147483647, x=126701535173, Y=1544423167, y=60, y++=782] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-382429231, X=2147483647, x=126701535173, x=83, x=126642699694, y=60, Y=1544423167, y++=782] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-382429231, x=128849018820, x=128187122861, X=2147483647, x=83, y=60, Y=1544423167, y++=782] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=84, v=-382429231, x=128187122861, X=2147483647, x=83, x=128849018820, y=60, Y=1544423167, y++=782] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=84, v=2706417103, X=2147483647, x=84, x=128849018820, x=128187122861, Y=1544423167, y=60, y++=782] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=2706417103, X=2147483647, x=84, x=128187122861, x=128849018820, y=60, Y=1544423167, y++=782] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=2706417103, x=128849018820, x=84, x=129731546028, X=2147483647, y=60, Y=1544423167, y++=782] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=85, v=2706417103, x=129731546028, x=84, X=2147483647, x=128849018820, Y=1544423167, y=60, y++=782] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=85, v=1500296143, x=128849018820, x=129731546028, x=85, X=2147483647, y=61, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=1500296143, x=128849018820, X=2147483647, x=85, x=129731546028, y=61, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=1500296143, x=130996502467, X=2147483647, x=85, x=131275969195, Y=1544423167, y=61, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=86, v=1500296143, x=85, x=131275969195, X=2147483647, x=130996502467, y=61, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=86, v=294175183, x=131275969195, x=130996502467, X=2147483647, x=86, Y=1544423167, y=62, y++=0] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=294175183, X=2147483647, x=131275969195, x=130996502467, x=86, y=62, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=294175183, x=86, x=132820392362, X=2147483647, x=133143986114, Y=1544423167, y=62, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=87, v=294175183, x=132820392362, x=133143986114, x=86, X=2147483647, y=62, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=87, v=-911945777, X=2147483647, x=87, x=133143986114, x=132820392362, Y=1544423167, y=63, y++=816] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-911945777, X=2147483647, x=132820392362, x=133143986114, x=87, Y=1544423167, y=63, y++=816] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-911945777, x=87, x=135291469761, x=134364815529, X=2147483647, Y=1544423167, y=63, y++=816] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=88, v=-911945777, x=87, x=135291469761, X=2147483647, x=134364815529, y=63, Y=1544423167, y++=816] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=88, v=2176900557, x=134364815529, X=2147483647, x=135291469761, x=88, Y=1544423167, y=63, y++=816] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=2176900557, x=134364815529, X=2147483647, x=135291469761, x=88, Y=1544423167, y=63, y++=816] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=2176900557, x=135909238696, x=135291469761, x=88, X=2147483647, Y=1544423167, y=63, y++=816] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=89, v=2176900557, x=88, X=2147483647, x=135291469761, x=135909238696, y=63, Y=1544423167, y++=816] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=89, v=970779597, X=2147483647, x=135291469761, x=89, x=135909238696, y=64, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=970779597, x=135291469761, X=2147483647, x=135909238696, x=89, y=64, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=970779597, x=137438953408, x=137453661863, x=89, X=2147483647, y=64, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=90, v=970779597, x=89, X=2147483647, x=137438953408, x=137453661863, y=64, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=90, v=-235341363, X=2147483647, x=137453661863, x=90, x=137438953408, Y=1544423167, y=65, y++=841] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-235341363, x=90, x=137453661863, x=137438953408, X=2147483647, Y=1544423167, y=65, y++=841] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-235341363, x=138998085030, x=90, X=2147483647, x=139586437055, y=65, Y=1544423167, y++=841] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=91, v=-235341363, X=2147483647, x=138998085030, x=90, x=139586437055, Y=1544423167, y=65, y++=841] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=91, v=2853504971, x=139586437055, X=2147483647, x=91, x=138998085030, y=65, Y=1544423167, y++=841] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=2853504971, x=91, x=138998085030, X=2147483647, x=139586437055, Y=1544423167, y=65, y++=841] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=2853504971, x=91, x=139586437055, X=2147483647, x=140542508197, Y=1544423167, y=65, y++=841] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=92, v=2853504971, X=2147483647, x=139586437055, x=91, x=140542508197, Y=1544423167, y=65, y++=841] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=92, v=1647384011, x=140542508197, x=92, X=2147483647, x=139586437055, Y=1544423167, y=66, y++=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=1647384011, x=140542508197, X=2147483647, x=139586437055, x=92, Y=1544423167, y=66, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=1647384011, x=142086931364, x=92, x=141733920702, X=2147483647, y=66, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=93, v=1647384011, x=141733920702, X=2147483647, x=142086931364, x=92, Y=1544423167, y=66, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=93, v=441263051, X=2147483647, x=142086931364, x=141733920702, x=93, y=67, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=441263051, x=141733920702, X=2147483647, x=142086931364, x=93, y=67, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=441263051, x=143881404349, x=93, X=2147483647, x=143631354531, y=67, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=94, v=441263051, x=93, X=2147483647, x=143881404349, x=143631354531, Y=1544423167, y=67, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=94, v=-764857909, X=2147483647, x=143631354531, x=94, x=143881404349, y=68, Y=1544423167, y++=873] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-764857909, X=2147483647, x=143631354531, x=143881404349, x=94, Y=1544423167, y=68, y++=873] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-764857909, x=94, X=2147483647, x=145175777698, x=146028887996, y=68, Y=1544423167, y++=873] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=95, v=-764857909, X=2147483647, x=146028887996, x=94, x=145175777698, Y=1544423167, y=68, y++=873] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=95, v=2323988425, x=146028887996, x=95, X=2147483647, x=145175777698, Y=1544423167, y=68, y++=873] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=2323988425, X=2147483647, x=145175777698, x=146028887996, x=95, y=68, Y=1544423167, y++=873] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=2323988425, X=2147483647, x=95, x=146720200865, x=146028887996, y=68, Y=1544423167, y++=873] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=96, v=2323988425, x=146720200865, x=146028887996, x=95, X=2147483647, y=68, Y=1544423167, y++=873] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=96, v=1117867465, X=2147483647, x=96, x=146028887996, x=146720200865, Y=1544423167, y=69, y++=0] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=1117867465, x=146028887996, x=146720200865, x=96, X=2147483647, Y=1544423167, y=69, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=1117867465, X=2147483647, x=148176371643, x=148264624032, x=96, y=69, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=97, v=1117867465, X=2147483647, x=96, x=148176371643, x=148264624032, y=69, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=97, v=-88253495, x=148264624032, x=148176371643, x=97, X=2147483647, y=70, Y=1544423167, y++=897] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-88253495, x=148176371643, x=97, x=148264624032, X=2147483647, Y=1544423167, y=70, y++=897] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-88253495, x=149809047199, x=97, x=150323855290, X=2147483647, y=70, Y=1544423167, y++=897] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=98, v=-88253495, x=97, x=150323855290, x=149809047199, X=2147483647, y=70, Y=1544423167, y++=897] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=98, v=3000592839, x=149809047199, x=98, X=2147483647, x=150323855290, Y=1544423167, y=70, y++=897] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=3000592839, x=150323855290, X=2147483647, x=149809047199, x=98, Y=1544423167, y=70, y++=897] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=3000592839, x=98, x=150323855290, x=151353470366, X=2147483647, y=70, Y=1544423167, y++=897] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=99, v=3000592839, x=98, x=150323855290, X=2147483647, x=151353470366, Y=1544423167, y=70, y++=897] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=99, v=1794471879, x=99, X=2147483647, x=151353470366, x=150323855290, y=71, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=1794471879, x=150323855290, x=151353470366, x=99, X=2147483647, Y=1544423167, y=71, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=1794471879, x=152471338937, X=2147483647, x=152897893533, x=99, Y=1544423167, y=71, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=100, v=1794471879, X=2147483647, x=152897893533, x=99, x=152471338937, Y=1544423167, y=71, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=100, v=588350919, x=100, X=2147483647, x=152897893533, x=152471338937, y=72, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=588350919, X=2147483647, x=100, x=152897893533, x=152471338937, y=72, Y=1544423167, y++=0] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=588350919, X=2147483647, x=154442316700, x=7200, x=100, y=72, Y=1544423167, y++=0] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 196.3s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2209 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2209 mSDsluCounter, 1953 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 764 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2642 IncrementalHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 764 mSolverCounterUnsat, 356 mSDtfsCounter, 2642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4779 GetRequests, 4003 SyntacticMatches, 90 SemanticMatches, 686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22711 ImplicationChecksByTransitivity, 100.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=9, InterpolantAutomatonStates: 599, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 57.7s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2992 ConstructedInterpolants, 0 QuantifiedInterpolants, 8217 SizeOfPredicates, 198 NumberOfNonLiveVariables, 4447 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 23482/92458 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 incorrect! [2022-11-19 06:59:01,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7f478f-b213-4806-9ed2-97005dbe377b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE