./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/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_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 01:56:03,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:56:03,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:56:04,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:56:04,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:56:04,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:56:04,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:56:04,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:56:04,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:56:04,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:56:04,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:56:04,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:56:04,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:56:04,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:56:04,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:56:04,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:56:04,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:56:04,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:56:04,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:56:04,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:56:04,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:56:04,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:56:04,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:56:04,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:56:04,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:56:04,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:56:04,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:56:04,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:56:04,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:56:04,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:56:04,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:56:04,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:56:04,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:56:04,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:56:04,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:56:04,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:56:04,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:56:04,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:56:04,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:56:04,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:56:04,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:56:04,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:56:04,123 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:56:04,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:56:04,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:56:04,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:56:04,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:56:04,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:56:04,130 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:56:04,130 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:56:04,131 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:56:04,131 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:56:04,132 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:56:04,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:56:04,132 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:56:04,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:56:04,133 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:56:04,133 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:56:04,133 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:56:04,134 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:56:04,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:56:04,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:56:04,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:56:04,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:56:04,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:56:04,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:56:04,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:56:04,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:56:04,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:56:04,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:56:04,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:56:04,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:56:04,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:56:04,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:56:04,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:56:04,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:56:04,139 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:56:04,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:56:04,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:56:04,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:56:04,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:56:04,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:56:04,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:56:04,141 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_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/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_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI 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-03 01:56:04,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:56:04,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:56:04,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:56:04,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:56:04,474 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:56:04,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-11-03 01:56:04,562 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/data/821aca723/6a2d5e3cb2ee4aab871441e6aaa57833/FLAGfaa88a3b3 [2022-11-03 01:56:04,955 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:56:04,955 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-11-03 01:56:04,961 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/data/821aca723/6a2d5e3cb2ee4aab871441e6aaa57833/FLAGfaa88a3b3 [2022-11-03 01:56:05,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/data/821aca723/6a2d5e3cb2ee4aab871441e6aaa57833 [2022-11-03 01:56:05,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:56:05,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:56:05,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:56:05,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:56:05,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:56:05,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cff3ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05, skipping insertion in model container [2022-11-03 01:56:05,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:56:05,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:56:05,614 WARN L230 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_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-11-03 01:56:05,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:56:05,656 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:56:05,681 WARN L230 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_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-11-03 01:56:05,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:56:05,712 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:56:05,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05 WrapperNode [2022-11-03 01:56:05,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:56:05,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:56:05,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:56:05,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:56:05,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,752 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-03 01:56:05,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:56:05,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:56:05,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:56:05,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:56:05,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:56:05,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:56:05,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:56:05,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:56:05,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (1/1) ... [2022-11-03 01:56:05,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:56:05,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:05,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:56:05,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:56:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:56:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:56:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:56:05,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:56:05,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 01:56:05,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 01:56:05,928 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:56:05,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:56:06,109 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:56:06,186 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:56:06,186 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:56:06,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:06 BoogieIcfgContainer [2022-11-03 01:56:06,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:56:06,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:56:06,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:56:06,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:56:06,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:56:05" (1/3) ... [2022-11-03 01:56:06,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86c56e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:56:06, skipping insertion in model container [2022-11-03 01:56:06,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:05" (2/3) ... [2022-11-03 01:56:06,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86c56e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:56:06, skipping insertion in model container [2022-11-03 01:56:06,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:06" (3/3) ... [2022-11-03 01:56:06,213 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2022-11-03 01:56:06,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:56:06,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:56:06,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:56:06,319 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;@3a1598fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:56:06,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:56:06,326 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-03 01:56:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:56:06,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:06,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:06,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-11-03 01:56:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:06,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294232699] [2022-11-03 01:56:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:06,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:06,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407434963] [2022-11-03 01:56:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:06,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:06,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:06,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:06,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:56:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:06,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:56:06,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:06,815 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-03 01:56:06,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:56:06,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294232699] [2022-11-03 01:56:06,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:56:06,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407434963] [2022-11-03 01:56:06,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407434963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:06,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:06,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638238669] [2022-11-03 01:56:06,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:06,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:06,888 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-03 01:56:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:07,062 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-11-03 01:56:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:07,067 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-03 01:56:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:07,079 INFO L225 Difference]: With dead ends: 42 [2022-11-03 01:56:07,079 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 01:56:07,083 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-03 01:56:07,087 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 34 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-03 01:56:07,089 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-03 01:56:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 01:56:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 01:56:07,125 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-03 01:56:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-03 01:56:07,127 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-11-03 01:56:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:07,128 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-03 01:56:07,128 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-03 01:56:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-03 01:56:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:07,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:07,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:07,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:07,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-03 01:56:07,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-11-03 01:56:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:07,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105136257] [2022-11-03 01:56:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:07,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:07,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881005137] [2022-11-03 01:56:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:07,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:07,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:07,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:07,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:56:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:07,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:56:07,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:07,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:56:08,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:08,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105136257] [2022-11-03 01:56:08,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:56:08,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881005137] [2022-11-03 01:56:08,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881005137] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:08,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569881344] [2022-11-03 01:56:08,044 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 01:56:08,045 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:08,048 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:08,054 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:08,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:08,734 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-11-03 01:56:08,799 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:09,288 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '224#(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-03 01:56:09,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:09,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:09,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-11-03 01:56:09,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995322830] [2022-11-03 01:56:09,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:56:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:56:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:56:09,291 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 2 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-03 01:56:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:09,681 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-11-03 01:56:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:56:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 2 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-03 01:56:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:09,683 INFO L225 Difference]: With dead ends: 35 [2022-11-03 01:56:09,683 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 01:56:09,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:56:09,685 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:09,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 01:56:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-11-03 01:56:09,696 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-03 01:56:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-03 01:56:09,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-11-03 01:56:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:09,698 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-03 01:56:09,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 2 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-03 01:56:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-03 01:56:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 01:56:09,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:09,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:09,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:09,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:09,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-11-03 01:56:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144088964] [2022-11-03 01:56:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:09,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:09,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333361735] [2022-11-03 01:56:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:09,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:09,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:09,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:09,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:56:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:09,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:56:09,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:10,013 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-03 01:56:10,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:10,049 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-03 01:56:10,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:10,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144088964] [2022-11-03 01:56:10,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:56:10,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333361735] [2022-11-03 01:56:10,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333361735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:10,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788200154] [2022-11-03 01:56:10,064 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:56:10,064 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:10,064 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:10,065 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:10,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:10,645 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 01:56:10,802 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:11,868 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '415#(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-03 01:56:11,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:11,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:11,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-03 01:56:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12351216] [2022-11-03 01:56:11,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:11,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:11,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:56:11,871 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-03 01:56:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:11,979 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-11-03 01:56:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:56:11,979 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-03 01:56:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:11,980 INFO L225 Difference]: With dead ends: 59 [2022-11-03 01:56:11,981 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 01:56:11,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:56:11,983 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:11,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 01:56:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-11-03 01:56:11,995 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-03 01:56:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-11-03 01:56:11,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-11-03 01:56:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:11,997 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-11-03 01:56:11,998 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-03 01:56:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-11-03 01:56:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:56:11,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:11,999 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:12,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:12,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:12,224 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-11-03 01:56:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:12,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423423820] [2022-11-03 01:56:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:12,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:12,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965077570] [2022-11-03 01:56:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:12,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:12,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:12,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:56:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:12,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:56:12,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:12,758 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-03 01:56:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:13,308 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-03 01:56:13,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423423820] [2022-11-03 01:56:13,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:56:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965077570] [2022-11-03 01:56:13,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965077570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1205499597] [2022-11-03 01:56:13,311 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:56:13,312 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:13,312 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:13,313 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:13,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:14,044 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-11-03 01:56:14,345 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:36,209 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '711#(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-03 01:56:36,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:36,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:36,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-11-03 01:56:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866404595] [2022-11-03 01:56:36,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:36,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:56:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:56:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=651, Unknown=4, NotChecked=0, Total=756 [2022-11-03 01:56:36,212 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 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-03 01:56:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:38,233 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-11-03 01:56:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:56:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 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-03 01:56:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:38,235 INFO L225 Difference]: With dead ends: 49 [2022-11-03 01:56:38,235 INFO L226 Difference]: Without dead ends: 41 [2022-11-03 01:56:38,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=186, Invalid=1142, Unknown=4, NotChecked=0, Total=1332 [2022-11-03 01:56:38,237 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:38,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 01:56:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-03 01:56:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-03 01:56:38,252 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-03 01:56:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-11-03 01:56:38,253 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-11-03 01:56:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:38,253 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-11-03 01:56:38,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 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-03 01:56:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-11-03 01:56:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 01:56:38,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:38,255 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:38,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-03 01:56:38,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:38,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-11-03 01:56:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:38,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345005772] [2022-11-03 01:56:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:38,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:38,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286963775] [2022-11-03 01:56:38,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:56:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:38,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:38,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:56:38,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 01:56:38,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:38,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:56:38,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:39,029 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-03 01:56:39,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:39,466 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-03 01:56:39,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:39,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345005772] [2022-11-03 01:56:39,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:56:39,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286963775] [2022-11-03 01:56:39,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286963775] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:39,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1151838905] [2022-11-03 01:56:39,469 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:56:39,470 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:39,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:39,470 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:39,471 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:39,944 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 01:56:40,090 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:42,809 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1110#(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-03 01:56:42,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:42,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:42,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-03 01:56:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080069399] [2022-11-03 01:56:42,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:42,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:56:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:42,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:56:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-11-03 01:56:42,812 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-03 01:56:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:43,794 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-11-03 01:56:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:56:43,795 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-03 01:56:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:43,796 INFO L225 Difference]: With dead ends: 95 [2022-11-03 01:56:43,796 INFO L226 Difference]: Without dead ends: 89 [2022-11-03 01:56:43,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 01:56:43,798 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:43,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 92 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:56:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-03 01:56:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-03 01:56:43,826 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-03 01:56:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-11-03 01:56:43,828 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-11-03 01:56:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:43,829 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-11-03 01:56:43,829 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-03 01:56:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-11-03 01:56:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 01:56:43,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:43,832 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:43,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:44,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:44,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-11-03 01:56:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:44,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478536116] [2022-11-03 01:56:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:44,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221790374] [2022-11-03 01:56:44,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:56:44,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:44,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:44,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:44,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:56:44,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:56:44,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:44,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 01:56:44,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:45,221 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-03 01:56:45,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:46,560 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-03 01:56:46,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478536116] [2022-11-03 01:56:46,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:56:46,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221790374] [2022-11-03 01:56:46,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221790374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:46,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183433515] [2022-11-03 01:56:46,563 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:56:46,563 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:46,564 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:46,564 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:46,564 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:47,020 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 01:56:47,157 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:51,054 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1938#(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-03 01:56:51,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:51,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:51,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-03 01:56:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928589316] [2022-11-03 01:56:51,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:51,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:56:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:56:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 01:56:51,059 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-03 01:56:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:53,653 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-11-03 01:56:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 01:56:53,655 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-03 01:56:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:53,657 INFO L225 Difference]: With dead ends: 191 [2022-11-03 01:56:53,657 INFO L226 Difference]: Without dead ends: 185 [2022-11-03 01:56:53,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2022-11-03 01:56:53,662 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 179 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:53,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 188 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 01:56:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-03 01:56:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-03 01:56:53,718 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-03 01:56:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-11-03 01:56:53,720 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-11-03 01:56:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:53,721 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-11-03 01:56:53,721 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-03 01:56:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-11-03 01:56:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-03 01:56:53,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:53,725 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:53,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:53,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 01:56:53,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-11-03 01:56:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:53,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563246432] [2022-11-03 01:56:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:53,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:56:53,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805149858] [2022-11-03 01:56:53,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:56:53,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:54,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:54,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:56:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:54,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 01:56:54,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:56,989 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-03 01:56:56,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:01,570 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-03 01:57:01,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:01,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563246432] [2022-11-03 01:57:01,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:57:01,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805149858] [2022-11-03 01:57:01,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805149858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:01,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033159245] [2022-11-03 01:57:01,573 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:57:01,573 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:57:01,574 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:57:01,574 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:57:01,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:57:02,021 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 01:57:02,168 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:57:06,747 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3654#(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-03 01:57:06,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:57:06,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:57:06,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-03 01:57:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625880190] [2022-11-03 01:57:06,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:06,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 01:57:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 01:57:06,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=2375, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 01:57:06,753 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-03 01:57:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:14,413 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-11-03 01:57:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-03 01:57:14,414 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-03 01:57:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:14,417 INFO L225 Difference]: With dead ends: 383 [2022-11-03 01:57:14,417 INFO L226 Difference]: Without dead ends: 377 [2022-11-03 01:57:14,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3348, Invalid=7572, Unknown=0, NotChecked=0, Total=10920 [2022-11-03 01:57:14,422 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 422 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:14,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 332 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 01:57:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-03 01:57:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-03 01:57:14,507 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-03 01:57:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-11-03 01:57:14,511 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-11-03 01:57:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:14,516 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-11-03 01:57:14,517 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-03 01:57:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-11-03 01:57:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-03 01:57:14,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:14,526 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:14,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:14,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:14,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-11-03 01:57:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:14,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728848833] [2022-11-03 01:57:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:14,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:57:14,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371143753] [2022-11-03 01:57:14,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:57:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:14,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:14,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:57:23,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-03 01:57:23,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:24,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-03 01:57:24,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:31,755 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-03 01:57:31,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:48,335 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-03 01:57:48,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:48,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728848833] [2022-11-03 01:57:48,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:57:48,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371143753] [2022-11-03 01:57:48,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371143753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:48,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [348927050] [2022-11-03 01:57:48,338 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:57:48,338 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:57:48,339 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:57:48,339 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:57:48,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:57:48,796 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 01:57:48,934 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:57:53,937 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7146#(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-03 01:57:53,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:57:53,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:57:53,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-03 01:57:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89160039] [2022-11-03 01:57:53,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:53,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-03 01:57:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-03 01:57:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4597, Invalid=6959, Unknown=0, NotChecked=0, Total=11556 [2022-11-03 01:57:53,945 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-03 01:58:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:16,938 INFO L93 Difference]: Finished difference Result 767 states and 814 transitions. [2022-11-03 01:58:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-03 01:58:16,939 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-03 01:58:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:16,945 INFO L225 Difference]: With dead ends: 767 [2022-11-03 01:58:16,945 INFO L226 Difference]: Without dead ends: 761 [2022-11-03 01:58:16,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=13572, Invalid=26628, Unknown=0, NotChecked=0, Total=40200 [2022-11-03 01:58:16,953 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1280 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:16,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 626 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-03 01:58:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-03 01:58:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-11-03 01:58:17,091 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-03 01:58:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 761 transitions. [2022-11-03 01:58:17,095 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 761 transitions. Word has length 376 [2022-11-03 01:58:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:17,096 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 761 transitions. [2022-11-03 01:58:17,097 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-03 01:58:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 761 transitions. [2022-11-03 01:58:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2022-11-03 01:58:17,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:17,122 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:17,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:17,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:17,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1094369733, now seen corresponding path program 6 times [2022-11-03 01:58:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:17,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220397828] [2022-11-03 01:58:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:17,414 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:58:17,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354341672] [2022-11-03 01:58:17,415 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:58:17,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:17,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:17,416 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:17,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:58:18,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:58:18,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:18,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-03 01:58:18,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:43,163 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-03 01:58:43,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:06,722 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-03 01:59:06,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:06,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220397828] [2022-11-03 01:59:06,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:59:06,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354341672] [2022-11-03 01:59:06,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354341672] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:59:06,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [79732814] [2022-11-03 01:59:06,726 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:59:06,726 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:59:06,727 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:59:06,727 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:59:06,727 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:59:07,131 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 01:59:07,254 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:59:17,100 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14100#(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-03 01:59:17,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:59:17,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:59:17,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-03 01:59:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306338628] [2022-11-03 01:59:17,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:59:17,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-03 01:59:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:17,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-03 01:59:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5188, Invalid=7693, Unknown=1, NotChecked=0, Total=12882 [2022-11-03 01:59:17,108 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-03 01:59:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:44,624 INFO L93 Difference]: Finished difference Result 815 states and 820 transitions. [2022-11-03 01:59:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-03 01:59:44,625 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-03 01:59:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:44,631 INFO L225 Difference]: With dead ends: 815 [2022-11-03 01:59:44,631 INFO L226 Difference]: Without dead ends: 809 [2022-11-03 01:59:44,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2377 GetRequests, 2076 SyntacticMatches, 90 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11259 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=15381, Invalid=29774, Unknown=1, NotChecked=0, Total=45156 [2022-11-03 01:59:44,636 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 314 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:44,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 554 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-03 01:59:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-03 01:59:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2022-11-03 01:59:44,819 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-03 01:59:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 809 transitions. [2022-11-03 01:59:44,822 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 809 transitions. Word has length 760 [2022-11-03 01:59:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:44,824 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 809 transitions. [2022-11-03 01:59:44,825 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-03 01:59:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 809 transitions. [2022-11-03 01:59:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2022-11-03 01:59:44,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:44,834 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:44,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:45,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:59:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1577450477, now seen corresponding path program 7 times [2022-11-03 01:59:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:45,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515221789] [2022-11-03 01:59:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:45,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:59:45,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971279662] [2022-11-03 01:59:45,122 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:59:45,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:45,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:45,123 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:45,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:59:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:59:59,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:00:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:00:02,491 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:00:02,491 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:00:02,492 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:00:02,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:00:02,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:00:02,712 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-11-03 02:00:02,717 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:00:02,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:00:02 BoogieIcfgContainer [2022-11-03 02:00:02,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:00:02,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:00:02,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:00:02,929 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:00:02,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:06" (3/4) ... [2022-11-03 02:00:02,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:00:03,164 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:00:03,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:00:03,165 INFO L158 Benchmark]: Toolchain (without parser) took 237803.91ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 72.7MB in the beginning and 45.7MB in the end (delta: 26.9MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2022-11-03 02:00:03,165 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory was 56.5MB in the beginning and 56.4MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:00:03,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.76ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 83.4MB in the end (delta: -11.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 02:00:03,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.13ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:00:03,166 INFO L158 Benchmark]: Boogie Preprocessor took 30.15ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 80.8MB in the end (delta: 900.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:00:03,166 INFO L158 Benchmark]: RCFGBuilder took 418.83ms. Allocated memory is still 107.0MB. Free memory was 80.8MB in the beginning and 68.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:00:03,167 INFO L158 Benchmark]: TraceAbstraction took 236721.74ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 67.8MB in the beginning and 80.3MB in the end (delta: -12.5MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2022-11-03 02:00:03,167 INFO L158 Benchmark]: Witness Printer took 236.01ms. Allocated memory is still 192.9MB. Free memory was 80.3MB in the beginning and 45.7MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-03 02:00:03,169 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 81.8MB. Free memory was 56.5MB in the beginning and 56.4MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.76ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 83.4MB in the end (delta: -11.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.13ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.15ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 80.8MB in the end (delta: 900.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 418.83ms. Allocated memory is still 107.0MB. Free memory was 80.8MB in the beginning and 68.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 236721.74ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 67.8MB in the beginning and 80.3MB in the end (delta: -12.5MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 236.01ms. Allocated memory is still 192.9MB. Free memory was 80.3MB in the beginning and 45.7MB in the end (delta: 34.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=-118, X=124, x=0, y=0, Y=3] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-118, X=124, x=0, y=0, Y=3] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-118, x=0, x=0, x=0, X=124, Y=3, 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=-118, X=124, x=0, x=0, x=0, y=0, Y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=1, v=-112, x=0, x=1, X=124, x=0, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-112, x=0, x=1, x=0, X=124, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-112, X=124, x=0, x=3, x=1, y=0, Y=3, y++=333] [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=-112, x=3, x=0, x=1, X=124, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=2, v=-106, x=2, x=3, x=0, X=124, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-106, x=2, x=0, x=3, X=124, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-106, X=124, x=6, x=0, x=2, y=0, Y=3, y++=333] [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=-106, x=2, x=0, X=124, x=6, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=3, v=-100, X=124, x=0, x=6, x=3, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-100, x=6, x=3, x=0, X=124, y=0, Y=3, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-100, X=124, x=3, x=0, x=9, y=0, Y=3, y++=333] [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=-100, x=0, x=3, x=9, X=124, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=4, v=-94, X=124, x=4, x=9, x=0, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-94, x=4, X=124, x=0, x=9, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-94, x=12, X=124, x=0, x=4, Y=3, y=0, y++=333] [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=-94, x=0, X=124, x=12, x=4, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=5, v=-88, x=5, X=124, x=0, x=12, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-88, x=12, X=124, x=5, x=0, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-88, x=15, x=0, x=5, X=124, y=0, Y=3, y++=333] [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=-88, x=15, x=5, x=0, X=124, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=6, v=-82, x=0, X=124, x=15, x=6, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-82, X=124, x=15, x=6, x=0, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-82, x=0, X=124, x=6, x=18, Y=3, y=0, y++=333] [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=-82, X=124, x=18, x=6, x=0, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=7, v=-76, X=124, x=18, x=0, x=7, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-76, x=0, X=124, x=18, x=7, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-76, x=7, X=124, x=0, x=21, y=0, Y=3, y++=333] [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=-76, x=21, X=124, x=0, x=7, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=8, v=-70, X=124, x=8, x=21, x=0, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-70, x=21, x=8, x=0, X=124, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-70, X=124, x=0, x=24, x=8, y=0, Y=3, y++=333] [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=-70, x=24, x=8, X=124, x=0, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=9, v=-64, x=24, x=0, X=124, x=9, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-64, x=24, x=9, X=124, x=0, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-64, X=124, x=9, x=27, x=0, Y=3, y=0, y++=333] [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=-64, x=27, X=124, x=0, x=9, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=10, v=-58, x=27, x=10, x=0, X=124, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-58, x=27, X=124, x=0, x=10, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-58, x=10, x=30, X=124, x=0, y=0, Y=3, y++=333] [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=-58, x=30, X=124, x=0, x=10, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=11, v=-52, x=0, X=124, x=30, x=11, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-52, X=124, x=30, x=0, x=11, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-52, x=0, x=33, x=11, X=124, Y=3, y=0, y++=333] [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=-52, x=0, X=124, x=33, x=11, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=12, v=-46, x=33, x=12, x=0, X=124, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-46, x=12, X=124, x=0, x=33, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-46, X=124, x=36, x=0, x=12, y=0, Y=3, y++=333] [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=-46, x=12, x=36, x=0, X=124, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=13, v=-40, x=0, x=36, x=13, X=124, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-40, x=0, X=124, x=36, x=13, y=0, Y=3, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-40, x=0, x=39, X=124, x=13, Y=3, y=0, y++=333] [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=-40, x=0, X=124, x=13, x=39, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=14, v=-34, x=0, x=14, X=124, x=39, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-34, x=14, x=0, X=124, x=39, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-34, x=42, x=14, X=124, x=0, y=0, Y=3, y++=333] [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=-34, x=0, X=124, x=14, x=42, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=15, v=-28, x=42, x=15, X=124, x=0, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-28, x=0, x=42, x=15, X=124, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-28, x=0, x=15, X=124, x=45, Y=3, y=0, y++=333] [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=-28, x=15, x=0, X=124, x=45, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=16, v=-22, x=45, x=16, X=124, x=0, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-22, x=16, X=124, x=0, x=45, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-22, x=0, x=16, X=124, x=48, y=0, Y=3, y++=333] [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=-22, x=0, x=16, x=48, X=124, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=17, v=-16, x=0, x=17, X=124, x=48, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-16, X=124, x=0, x=48, x=17, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-16, x=0, X=124, x=17, x=51, Y=3, y=0, y++=333] [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=-16, x=51, x=17, X=124, x=0, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=18, v=-10, x=51, x=0, X=124, x=18, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-10, x=0, X=124, x=51, x=18, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-10, x=54, X=124, x=18, x=0, Y=3, y=0, y++=333] [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=-10, x=54, x=0, X=124, x=18, Y=3, y=0, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=19, v=-4, X=124, x=19, x=54, x=0, y=0, Y=3, y++=333] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-4, x=54, X=124, x=19, x=0, Y=3, y=0, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-4, x=0, X=124, x=19, x=57, Y=3, y=0, y++=333] [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=-4, x=0, x=19, x=57, X=124, y=0, Y=3, y++=333] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=20, v=2, x=57, x=20, X=124, x=0, Y=3, y=0, y++=333] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=2, x=20, x=0, X=124, x=57, y=0, Y=3, y++=333] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=2, x=20, x=60, x=0, X=124, Y=3, y=0, y++=333] [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=2, x=0, x=20, X=124, x=60, Y=3, y=0, y++=333] [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=-240, x=0, x=21, x=60, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-240, x=21, X=124, x=60, x=0, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-240, x=124, x=21, x=63, X=124, Y=3, y=1, y++=681] [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=-240, x=21, x=63, X=124, x=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=22, v=-234, x=124, x=63, x=22, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-234, x=63, X=124, x=22, x=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-234, x=124, X=124, x=22, x=66, y=1, Y=3, y++=681] [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=-234, x=22, x=124, x=66, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=23, v=-228, x=66, x=23, x=124, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-228, x=66, x=23, X=124, x=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-228, x=23, x=69, x=124, X=124, Y=3, y=1, y++=681] [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=-228, x=23, x=69, x=124, X=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=24, v=-222, x=69, x=124, X=124, x=24, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-222, x=69, x=124, X=124, x=24, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-222, X=124, x=124, x=24, x=72, y=1, Y=3, y++=681] [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=-222, x=72, x=124, X=124, x=24, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=25, v=-216, X=124, x=72, x=124, x=25, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-216, x=25, x=72, x=124, X=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-216, x=25, X=124, x=75, x=124, Y=3, y=1, y++=681] [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=-216, x=75, x=25, X=124, x=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=26, v=-210, X=124, x=124, x=75, x=26, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-210, x=124, x=26, X=124, x=75, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-210, x=26, x=78, X=124, x=124, Y=3, y=1, y++=681] [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=-210, x=124, x=26, x=78, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=27, v=-204, x=124, x=78, X=124, x=27, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-204, x=78, x=27, x=124, X=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-204, x=81, X=124, x=27, x=124, Y=3, y=1, y++=681] [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=-204, x=124, x=27, X=124, x=81, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=28, v=-198, x=124, X=124, x=81, x=28, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-198, x=81, x=124, x=28, X=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-198, x=124, x=28, x=84, X=124, Y=3, y=1, y++=681] [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=-198, x=84, x=124, X=124, x=28, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=29, v=-192, x=124, X=124, x=29, x=84, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-192, x=124, x=29, x=84, X=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-192, x=87, x=29, X=124, x=124, y=1, Y=3, y++=681] [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=-192, x=87, x=29, x=124, X=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=30, v=-186, x=87, x=124, x=30, X=124, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-186, X=124, x=87, x=124, x=30, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-186, x=124, x=30, X=124, x=90, Y=3, y=1, y++=681] [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=-186, x=124, x=30, X=124, x=90, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=31, v=-180, x=90, x=124, X=124, x=31, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-180, X=124, x=90, x=31, x=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-180, X=124, x=31, x=93, x=124, Y=3, y=1, y++=681] [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=-180, X=124, x=31, x=93, x=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=32, v=-174, X=124, x=32, x=124, x=93, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-174, x=93, X=124, x=32, x=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-174, x=96, X=124, x=124, x=32, y=1, Y=3, y++=681] [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=-174, x=124, x=96, x=32, X=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=33, v=-168, X=124, x=96, x=33, x=124, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-168, x=124, X=124, x=33, x=96, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-168, x=33, X=124, x=124, x=99, y=1, Y=3, y++=681] [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=-168, X=124, x=124, x=33, x=99, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=34, v=-162, x=99, X=124, x=34, x=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-162, x=99, x=124, x=34, X=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-162, X=124, x=34, x=124, x=102, y=1, Y=3, y++=681] [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=-162, x=34, x=124, x=102, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=35, v=-156, X=124, x=102, x=124, x=35, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-156, x=102, x=124, X=124, x=35, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-156, x=124, x=105, x=35, X=124, Y=3, y=1, y++=681] [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=-156, X=124, x=124, x=35, x=105, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=36, v=-150, x=124, x=36, x=105, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-150, x=36, X=124, x=124, x=105, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-150, x=108, X=124, x=36, x=124, y=1, Y=3, y++=681] [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=-150, X=124, x=108, x=124, x=36, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=37, v=-144, x=108, x=124, x=37, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-144, x=108, x=124, x=37, X=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-144, x=124, x=37, X=124, x=111, Y=3, y=1, y++=681] [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=-144, x=37, x=111, x=124, X=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=38, v=-138, x=111, X=124, x=38, x=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-138, x=124, x=111, x=38, X=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-138, X=124, x=114, x=124, x=38, y=1, Y=3, y++=681] [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=-138, X=124, x=124, x=114, x=38, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=39, v=-132, x=39, x=124, x=114, X=124, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-132, x=114, X=124, x=124, x=39, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-132, x=124, x=117, X=124, x=39, Y=3, y=1, y++=681] [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=-132, x=117, x=124, X=124, x=39, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=40, v=-126, X=124, x=124, x=40, x=117, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-126, x=117, x=124, X=124, x=40, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-126, x=120, x=40, X=124, x=124, Y=3, y=1, y++=681] [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=-126, x=120, X=124, x=124, x=40, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=41, v=-120, x=120, x=124, X=124, x=41, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-120, x=124, X=124, x=120, x=41, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-120, x=124, x=123, X=124, x=41, y=1, Y=3, y++=681] [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=-120, x=124, x=123, x=41, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=42, v=-114, x=123, x=124, X=124, x=42, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-114, X=124, x=124, x=42, x=123, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-114, X=124, x=124, x=42, x=126, y=1, Y=3, y++=681] [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=-114, x=42, x=124, X=124, x=126, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=43, v=-108, x=126, x=124, x=43, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-108, x=124, x=43, X=124, x=126, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-108, x=43, x=129, X=124, x=124, y=1, Y=3, y++=681] [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=-108, x=124, x=129, X=124, x=43, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=44, v=-102, x=124, X=124, x=129, x=44, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-102, x=44, x=124, x=129, X=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-102, x=44, x=124, x=132, X=124, Y=3, y=1, y++=681] [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=-102, x=124, x=132, x=44, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=45, v=-96, X=124, x=132, x=124, x=45, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-96, X=124, x=45, x=124, x=132, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-96, x=45, x=135, X=124, x=124, Y=3, y=1, y++=681] [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=-96, x=45, X=124, x=135, x=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=46, v=-90, x=124, x=135, X=124, x=46, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-90, x=135, x=46, X=124, x=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-90, x=46, x=138, X=124, x=124, Y=3, y=1, y++=681] [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=-90, x=46, x=138, X=124, x=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=47, v=-84, x=47, x=124, X=124, x=138, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-84, x=124, x=47, X=124, x=138, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-84, X=124, x=141, x=124, x=47, y=1, Y=3, y++=681] [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=-84, x=47, x=141, X=124, x=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=48, v=-78, x=124, X=124, x=141, x=48, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-78, X=124, x=124, x=141, x=48, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-78, x=48, x=124, x=144, X=124, y=1, Y=3, y++=681] [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=-78, X=124, x=124, x=48, x=144, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=49, v=-72, x=144, x=49, X=124, x=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-72, x=144, X=124, x=124, x=49, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-72, X=124, x=147, x=124, x=49, y=1, Y=3, y++=681] [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=-72, X=124, x=49, x=124, x=147, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=50, v=-66, x=124, X=124, x=50, x=147, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-66, x=50, X=124, x=124, x=147, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-66, x=124, x=50, X=124, x=150, y=1, Y=3, y++=681] [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=-66, x=50, X=124, x=150, x=124, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=51, v=-60, X=124, x=124, x=51, x=150, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-60, x=51, X=124, x=150, x=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-60, x=153, x=51, x=124, X=124, y=1, Y=3, y++=681] [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=-60, X=124, x=51, x=153, x=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=52, v=-54, x=153, x=124, x=52, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-54, x=52, x=153, X=124, x=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-54, x=124, x=52, x=156, X=124, Y=3, y=1, y++=681] [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=-54, x=52, X=124, x=124, x=156, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=53, v=-48, x=53, x=124, x=156, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-48, x=156, X=124, x=53, x=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-48, x=159, X=124, x=124, x=53, y=1, Y=3, y++=681] [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=-48, x=159, x=124, x=53, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=54, v=-42, X=124, x=124, x=159, x=54, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-42, X=124, x=159, x=124, x=54, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-42, x=54, x=124, X=124, x=162, y=1, Y=3, y++=681] [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=-42, x=54, x=124, X=124, x=162, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=55, v=-36, x=162, X=124, x=124, x=55, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-36, X=124, x=162, x=55, x=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-36, X=124, x=165, x=55, x=124, y=1, Y=3, y++=681] [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=-36, X=124, x=165, x=124, x=55, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=56, v=-30, x=56, X=124, x=165, x=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-30, x=124, x=165, x=56, X=124, Y=3, y=1, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-30, x=168, x=56, x=124, X=124, Y=3, y=1, y++=681] [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=-30, x=168, x=124, X=124, x=56, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=57, v=-24, x=124, x=57, x=168, X=124, y=1, Y=3, y++=681] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-24, x=168, X=124, x=124, x=57, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-24, x=171, X=124, x=124, x=57, y=1, Y=3, y++=681] [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=-24, X=124, x=57, x=124, x=171, Y=3, y=1, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=58, v=-18, X=124, x=171, x=124, x=58, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-18, x=58, X=124, x=124, x=171, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-18, x=124, x=174, x=58, X=124, y=1, Y=3, y++=681] [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=-18, x=124, x=58, x=174, X=124, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=59, v=-12, x=174, x=124, x=59, X=124, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-12, X=124, x=174, x=59, x=124, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-12, x=59, x=124, X=124, x=177, Y=3, y=1, y++=681] [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=-12, x=124, X=124, x=177, x=59, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=60, v=-6, x=177, x=60, X=124, x=124, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-6, x=124, X=124, x=60, x=177, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-6, x=124, x=180, x=60, X=124, Y=3, y=1, y++=681] [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=-6, x=60, x=124, X=124, x=180, y=1, Y=3, y++=681] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=61, v=0, x=180, x=124, X=124, x=61, Y=3, y=1, y++=681] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=0, X=124, x=180, x=124, x=61, y=1, Y=3, y++=681] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=0, x=183, X=124, x=124, x=61, y=1, Y=3, y++=681] [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=0, x=124, x=183, x=61, X=124, Y=3, y=1, y++=681] [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=-242, x=183, x=124, X=124, x=62, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-242, x=124, x=62, X=124, x=183, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-242, x=62, x=248, x=186, X=124, y=2, Y=3, y++=889] [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=-242, x=186, x=248, x=62, X=124, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=63, v=-236, x=186, x=63, x=248, X=124, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-236, x=186, x=248, X=124, x=63, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-236, x=189, X=124, x=248, x=63, Y=3, y=2, y++=889] [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=-236, x=63, x=189, x=248, X=124, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=64, v=-230, x=189, x=248, X=124, x=64, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-230, x=64, X=124, x=189, x=248, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-230, x=64, x=192, X=124, x=248, Y=3, y=2, y++=889] [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=-230, x=248, X=124, x=64, x=192, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=65, v=-224, x=192, X=124, x=65, x=248, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-224, X=124, x=192, x=248, x=65, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-224, x=65, x=195, x=248, X=124, y=2, Y=3, y++=889] [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=-224, X=124, x=195, x=65, x=248, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=66, v=-218, x=195, X=124, x=248, x=66, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-218, x=195, X=124, x=66, x=248, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-218, x=248, x=66, x=198, X=124, Y=3, y=2, y++=889] [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=-218, x=198, X=124, x=248, x=66, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=67, v=-212, x=198, x=67, x=248, X=124, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-212, x=198, X=124, x=248, x=67, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-212, x=248, x=201, x=67, X=124, y=2, Y=3, y++=889] [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=-212, x=67, x=201, x=248, X=124, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=68, v=-206, x=248, X=124, x=201, x=68, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-206, X=124, x=248, x=68, x=201, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-206, x=68, x=204, x=248, X=124, Y=3, y=2, y++=889] [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=-206, x=68, x=248, X=124, x=204, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=69, v=-200, x=248, x=204, X=124, x=69, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-200, x=248, X=124, x=69, x=204, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-200, x=248, x=69, X=124, x=207, y=2, Y=3, y++=889] [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=-200, x=69, x=207, x=248, X=124, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=70, v=-194, x=70, x=207, X=124, x=248, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-194, x=248, x=70, x=207, X=124, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-194, X=124, x=248, x=210, x=70, y=2, Y=3, y++=889] [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=-194, x=70, X=124, x=248, x=210, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=71, v=-188, x=71, x=248, X=124, x=210, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-188, x=71, x=248, x=210, X=124, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-188, X=124, x=248, x=213, x=71, Y=3, y=2, y++=889] [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=-188, x=213, X=124, x=248, x=71, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=72, v=-182, x=72, x=248, X=124, x=213, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-182, x=213, X=124, x=72, x=248, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-182, x=216, X=124, x=72, x=248, Y=3, y=2, y++=889] [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=-182, x=248, X=124, x=216, x=72, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=73, v=-176, x=248, x=216, X=124, x=73, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-176, x=216, x=248, X=124, x=73, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-176, x=219, x=73, x=248, X=124, Y=3, y=2, y++=889] [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=-176, x=219, x=248, X=124, x=73, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=74, v=-170, X=124, x=219, x=74, x=248, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-170, x=219, X=124, x=74, x=248, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-170, X=124, x=74, x=222, x=248, y=2, Y=3, y++=889] [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=-170, x=74, x=248, X=124, x=222, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=75, v=-164, X=124, x=222, x=248, x=75, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-164, x=248, x=222, x=75, X=124, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-164, X=124, x=248, x=225, x=75, y=2, Y=3, y++=889] [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=-164, x=225, x=248, x=75, X=124, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=76, v=-158, x=225, x=76, x=248, X=124, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-158, X=124, x=76, x=225, x=248, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-158, x=228, x=248, x=76, X=124, y=2, Y=3, y++=889] [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=-158, X=124, x=76, x=228, x=248, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=77, v=-152, x=248, x=77, X=124, x=228, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-152, x=248, x=77, x=228, X=124, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-152, x=231, x=77, X=124, x=248, Y=3, y=2, y++=889] [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=-152, x=231, X=124, x=77, x=248, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=78, v=-146, x=78, x=231, x=248, X=124, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-146, x=231, X=124, x=78, x=248, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-146, x=78, x=234, x=248, X=124, y=2, Y=3, y++=889] [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=-146, X=124, x=234, x=248, x=78, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=79, v=-140, x=234, x=79, x=248, X=124, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-140, X=124, x=234, x=248, x=79, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-140, x=248, x=237, x=79, X=124, Y=3, y=2, y++=889] [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=-140, x=248, x=79, X=124, x=237, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=80, v=-134, x=80, x=237, x=248, X=124, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-134, X=124, x=248, x=237, x=80, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-134, x=80, x=248, X=124, x=240, Y=3, y=2, y++=889] [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=-134, x=80, x=240, x=248, X=124, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=81, v=-128, x=240, x=248, x=81, X=124, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-128, X=124, x=81, x=240, x=248, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-128, x=243, x=81, x=248, X=124, y=2, Y=3, y++=889] [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=-128, x=81, x=248, X=124, x=243, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=82, v=-122, X=124, x=82, x=248, x=243, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-122, x=243, x=248, X=124, x=82, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-122, X=124, x=248, x=246, x=82, Y=3, y=2, y++=889] [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=-122, x=246, X=124, x=248, x=82, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=83, v=-116, x=83, x=246, X=124, x=248, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-116, x=246, x=248, X=124, x=83, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-116, x=248, x=249, X=124, x=83, y=2, Y=3, y++=889] [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=-116, x=248, x=249, x=83, X=124, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=84, v=-110, x=84, X=124, x=249, x=248, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-110, X=124, x=248, x=84, x=249, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-110, x=84, x=248, x=252, X=124, y=2, Y=3, y++=889] [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=-110, x=252, x=248, x=84, X=124, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=85, v=-104, x=252, X=124, x=248, x=85, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-104, X=124, x=248, x=85, x=252, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-104, X=124, x=85, x=255, x=248, Y=3, y=2, y++=889] [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=-104, x=85, x=248, x=255, X=124, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=86, v=-98, x=255, x=248, X=124, x=86, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-98, X=124, x=86, x=255, x=248, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-98, x=248, x=86, x=258, X=124, Y=3, y=2, y++=889] [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=-98, x=86, x=248, X=124, x=258, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=87, v=-92, x=87, x=248, x=258, X=124, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-92, X=124, x=258, x=248, x=87, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-92, x=261, x=87, x=248, X=124, Y=3, y=2, y++=889] [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=-92, x=248, x=87, X=124, x=261, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=88, v=-86, x=88, x=248, X=124, x=261, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-86, x=261, X=124, x=248, x=88, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-86, x=264, x=88, X=124, x=248, y=2, Y=3, y++=889] [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=-86, x=248, X=124, x=88, x=264, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=89, v=-80, x=248, X=124, x=264, x=89, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-80, x=264, X=124, x=248, x=89, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-80, x=267, X=124, x=89, x=248, y=2, Y=3, y++=889] [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=-80, x=248, x=267, x=89, X=124, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=90, v=-74, x=267, x=248, x=90, X=124, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-74, x=248, X=124, x=267, x=90, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-74, x=90, x=248, X=124, x=270, Y=3, y=2, y++=889] [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=-74, x=90, X=124, x=248, x=270, Y=3, y=2, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=91, v=-68, X=124, x=270, x=91, x=248, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-68, x=270, X=124, x=248, x=91, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-68, x=273, x=248, x=91, X=124, Y=3, y=2, y++=889] [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=-68, x=91, x=273, X=124, x=248, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=92, v=-62, x=92, x=248, x=273, X=124, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-62, X=124, x=92, x=248, x=273, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-62, x=92, x=248, x=276, X=124, Y=3, y=2, y++=889] [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=-62, x=276, X=124, x=92, x=248, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=93, v=-56, x=276, X=124, x=93, x=248, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-56, x=93, X=124, x=248, x=276, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-56, x=279, x=248, x=93, X=124, y=2, Y=3, y++=889] [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=-56, X=124, x=248, x=279, x=93, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=94, v=-50, x=279, X=124, x=94, x=248, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-50, x=94, X=124, x=248, x=279, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-50, x=94, x=248, X=124, x=282, y=2, Y=3, y++=889] [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=-50, X=124, x=94, x=248, x=282, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=95, v=-44, X=124, x=282, x=248, x=95, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-44, X=124, x=95, x=248, x=282, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-44, x=248, X=124, x=95, x=285, y=2, Y=3, y++=889] [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=-44, X=124, x=248, x=285, x=95, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=96, v=-38, X=124, x=96, x=248, x=285, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-38, x=285, x=248, X=124, x=96, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-38, X=124, x=248, x=288, x=96, Y=3, y=2, y++=889] [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=-38, x=248, X=124, x=288, x=96, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=97, v=-32, x=288, x=248, x=97, X=124, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-32, x=248, X=124, x=288, x=97, Y=3, y=2, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-32, x=291, x=97, X=124, x=248, y=2, Y=3, y++=889] [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=-32, x=248, x=97, X=124, x=291, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=98, v=-26, x=248, X=124, x=98, x=291, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-26, x=98, x=248, X=124, x=291, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-26, x=248, x=98, X=124, x=294, Y=3, y=2, y++=889] [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=-26, x=294, x=98, x=248, X=124, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=99, v=-20, X=124, x=99, x=294, x=248, Y=3, y=2, y++=889] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=-20, X=124, x=248, x=294, x=99, y=2, Y=3, y++=889] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=-20, x=248, X=124, x=99, x=297, Y=3, y=2, y++=889] [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=-20, x=248, x=297, x=99, X=124, y=2, Y=3, y++=889] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=100, v=-14, X=124, x=100, x=248, x=297, y=2, Y=3, y++=889] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-14, x=100, X=124, x=248, x=297, Y=3, y=2, y++=889] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-14, x=100, x=300, X=124, x=200, Y=3, y=2, y++=889] [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: 236.4s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 64.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2365 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2365 mSDsluCounter, 1974 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1913 mSDsCounter, 932 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2552 IncrementalHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 932 mSolverCounterUnsat, 357 mSDtfsCounter, 2552 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4778 GetRequests, 4006 SyntacticMatches, 94 SemanticMatches, 678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22625 ImplicationChecksByTransitivity, 167.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=9, InterpolantAutomatonStates: 597, 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, 24.2s SatisfiabilityAnalysisTime, 85.3s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2992 ConstructedInterpolants, 0 QuantifiedInterpolants, 8139 SizeOfPredicates, 193 NumberOfNonLiveVariables, 4447 ConjunctsInSsa, 426 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 23484/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-03 02:00:03,392 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-03 02:00:03,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc0a726c-0c91-4320-b19f-9f3ab4960f1e/bin/utaipan-7li7fVZpFI/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