./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/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_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 13:05:11,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:05:11,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:05:11,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:05:11,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:05:11,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:05:11,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:05:11,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:05:11,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:05:11,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:05:11,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:05:11,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:05:11,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:05:11,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:05:11,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:05:11,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:05:11,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:05:11,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:05:11,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:05:11,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:05:11,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:05:11,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:05:11,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:05:11,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:05:11,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:05:11,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:05:11,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:05:11,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:05:11,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:05:11,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:05:11,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:05:11,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:05:11,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:05:11,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:05:11,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:05:11,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:05:11,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:05:11,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:05:11,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:05:11,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:05:11,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:05:11,919 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 13:05:11,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:05:11,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:05:11,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:05:11,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:05:11,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:05:11,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:05:11,951 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:05:11,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:05:11,962 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:05:11,962 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:05:11,962 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:05:11,963 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:05:11,963 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:05:11,963 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:05:11,963 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:05:11,963 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:05:11,963 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:05:11,964 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:05:11,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:05:11,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:05:11,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:05:11,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:05:11,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:05:11,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:05:11,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:05:11,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:05:11,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:05:11,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:05:11,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:05:11,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:05:11,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:05:11,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:05:11,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:05:11,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:05:11,967 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:05:11,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:05:11,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:05:11,967 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:05:11,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:05:11,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:05:11,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:05:11,968 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_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/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_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh 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-12-14 13:05:12,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:05:12,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:05:12,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:05:12,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:05:12,153 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:05:12,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-12-14 13:05:14,767 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:05:14,929 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:05:14,930 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-12-14 13:05:14,935 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/data/29909ce37/76691463f2714b92896933f9dbb6cde0/FLAG806267df0 [2022-12-14 13:05:14,946 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/data/29909ce37/76691463f2714b92896933f9dbb6cde0 [2022-12-14 13:05:14,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:05:14,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:05:14,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:05:14,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:05:14,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:05:14,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:05:14" (1/1) ... [2022-12-14 13:05:14,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294efa89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:14, skipping insertion in model container [2022-12-14 13:05:14,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:05:14" (1/1) ... [2022-12-14 13:05:14,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:05:14,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:05:15,072 WARN L237 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_16b0606f-b9cf-46bb-b684-f25d2bd55e82/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-12-14 13:05:15,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:05:15,091 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:05:15,099 WARN L237 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_16b0606f-b9cf-46bb-b684-f25d2bd55e82/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-12-14 13:05:15,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:05:15,113 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:05:15,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15 WrapperNode [2022-12-14 13:05:15,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:05:15,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:05:15,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:05:15,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:05:15,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,137 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-12-14 13:05:15,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:05:15,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:05:15,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:05:15,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:05:15,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,149 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:05:15,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:05:15,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:05:15,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:05:15,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (1/1) ... [2022-12-14 13:05:15,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:05:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:15,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:05:15,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:05:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:05:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:05:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:05:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:05:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 13:05:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 13:05:15,269 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:05:15,271 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:05:15,378 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:05:15,409 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:05:15,410 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 13:05:15,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:05:15 BoogieIcfgContainer [2022-12-14 13:05:15,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:05:15,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:05:15,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:05:15,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:05:15,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:05:14" (1/3) ... [2022-12-14 13:05:15,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a76eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:05:15, skipping insertion in model container [2022-12-14 13:05:15,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:05:15" (2/3) ... [2022-12-14 13:05:15,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a76eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:05:15, skipping insertion in model container [2022-12-14 13:05:15,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:05:15" (3/3) ... [2022-12-14 13:05:15,420 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2022-12-14 13:05:15,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:05:15,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:05:15,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:05:15,484 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;@e77c799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:05:15,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 13:05:15,488 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-12-14 13:05:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 13:05:15,494 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:15,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:15,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-12-14 13:05:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:15,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209181006] [2022-12-14 13:05:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:15,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:15,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12617520] [2022-12-14 13:05:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:15,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:15,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:15,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:05:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:05:15,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 13:05:15,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:15,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:05:15,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:15,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209181006] [2022-12-14 13:05:15,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:15,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12617520] [2022-12-14 13:05:15,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12617520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:05:15,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:05:15,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:05:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101575787] [2022-12-14 13:05:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:05:15,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:05:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:05:15,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:05:15,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:05:15,819 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-12-14 13:05:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:05:15,927 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-12-14 13:05:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:05:15,929 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-12-14 13:05:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:05:15,934 INFO L225 Difference]: With dead ends: 42 [2022-12-14 13:05:15,935 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 13:05:15,937 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-12-14 13:05:15,939 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:05:15,940 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-12-14 13:05:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 13:05:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-14 13:05:15,974 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-12-14 13:05:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-12-14 13:05:15,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-12-14 13:05:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:05:15,976 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-12-14 13:05:15,977 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-12-14 13:05:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-12-14 13:05:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 13:05:15,978 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:15,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:15,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:05:16,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-14 13:05:16,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-12-14 13:05:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:16,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791796648] [2022-12-14 13:05:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:16,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:16,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233238354] [2022-12-14 13:05:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:16,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:16,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:16,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:16,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:05:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:05:16,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 13:05:16,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:16,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:05:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:17,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:17,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791796648] [2022-12-14 13:05:17,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:17,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233238354] [2022-12-14 13:05:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233238354] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:05:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316223177] [2022-12-14 13:05:17,109 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 13:05:17,109 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:05:17,112 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:05:17,115 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:05:17,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:05:17,541 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-12-14 13:05:17,580 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:05:17,953 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '230#(and (< ~counter~0 101) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 13:05:17,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:05:17,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:05:17,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-12-14 13:05:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887259570] [2022-12-14 13:05:17,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:05:17,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 13:05:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:05:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 13:05:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-12-14 13:05:17,957 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 13:05:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:05:18,183 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-12-14 13:05:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:05:18,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-12-14 13:05:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:05:18,184 INFO L225 Difference]: With dead ends: 35 [2022-12-14 13:05:18,184 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 13:05:18,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2022-12-14 13:05:18,185 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:05:18,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 34 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:05:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 13:05:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-12-14 13:05:18,190 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-12-14 13:05:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-12-14 13:05:18,191 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-12-14 13:05:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:05:18,191 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-12-14 13:05:18,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 13:05:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-12-14 13:05:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:05:18,192 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:18,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:18,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:05:18,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-14 13:05:18,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-12-14 13:05:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:18,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458741694] [2022-12-14 13:05:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:18,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:18,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822920193] [2022-12-14 13:05:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:18,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:18,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 13:05:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:05:18,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 13:05:18,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:18,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:05:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:18,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:18,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458741694] [2022-12-14 13:05:18,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:18,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822920193] [2022-12-14 13:05:18,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822920193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:05:18,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1120596600] [2022-12-14 13:05:18,486 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:05:18,486 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:05:18,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:05:18,487 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:05:18,487 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:05:18,830 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 13:05:18,948 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:05:26,199 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 84 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:05:30,377 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '423#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:05:30,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:05:30,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:05:30,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-12-14 13:05:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467104427] [2022-12-14 13:05:30,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:05:30,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:05:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:05:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:05:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2022-12-14 13:05:30,380 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-12-14 13:05:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:05:30,452 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-12-14 13:05:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 13:05:30,453 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-12-14 13:05:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:05:30,453 INFO L225 Difference]: With dead ends: 59 [2022-12-14 13:05:30,453 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 13:05:30,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=72, Invalid=347, Unknown=1, NotChecked=0, Total=420 [2022-12-14 13:05:30,454 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:05:30,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 68 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:05:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 13:05:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-12-14 13:05:30,461 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-12-14 13:05:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-12-14 13:05:30,462 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-12-14 13:05:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:05:30,462 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-12-14 13:05:30,462 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-12-14 13:05:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-12-14 13:05:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:05:30,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:30,463 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:30,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 13:05:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-14 13:05:30,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-12-14 13:05:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:30,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515439809] [2022-12-14 13:05:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:30,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:30,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272436967] [2022-12-14 13:05:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:30,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:30,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 13:05:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:05:30,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 13:05:30,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:05:31,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:05:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:05:31,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:31,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515439809] [2022-12-14 13:05:31,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:31,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272436967] [2022-12-14 13:05:31,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272436967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:05:31,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1150607715] [2022-12-14 13:05:31,491 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:05:31,491 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:05:31,492 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:05:31,492 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:05:31,492 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:05:31,799 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-12-14 13:05:31,920 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:05:45,842 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '720#(and (<= 0 |#NULL.base|) (< ~counter~0 101) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:05:45,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:05:45,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:05:45,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2022-12-14 13:05:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952236206] [2022-12-14 13:05:45,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:05:45,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 13:05:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:05:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 13:05:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=704, Unknown=5, NotChecked=0, Total=812 [2022-12-14 13:05:45,845 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 13:05:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:05:46,530 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-12-14 13:05:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 13:05:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2022-12-14 13:05:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:05:46,531 INFO L225 Difference]: With dead ends: 49 [2022-12-14 13:05:46,531 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 13:05:46,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=190, Invalid=1211, Unknown=5, NotChecked=0, Total=1406 [2022-12-14 13:05:46,533 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:05:46,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 58 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:05:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 13:05:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-12-14 13:05:46,540 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-12-14 13:05:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-12-14 13:05:46,540 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-12-14 13:05:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:05:46,540 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-12-14 13:05:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 13:05:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-12-14 13:05:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 13:05:46,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:46,541 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:46,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 13:05:46,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:46,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:46,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-12-14 13:05:46,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:46,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673567960] [2022-12-14 13:05:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:46,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:46,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1367869466] [2022-12-14 13:05:46,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:05:46,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:46,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:46,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 13:05:46,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 13:05:46,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:05:46,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 13:05:46,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:46,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:05:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 13:05:47,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673567960] [2022-12-14 13:05:47,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367869466] [2022-12-14 13:05:47,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367869466] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:05:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650134754] [2022-12-14 13:05:47,017 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:05:47,017 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:05:47,017 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:05:47,017 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:05:47,017 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:05:47,295 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 13:05:47,395 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:05:48,824 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1119#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:05:48,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:05:48,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:05:48,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-12-14 13:05:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242146680] [2022-12-14 13:05:48,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:05:48,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 13:05:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:05:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 13:05:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-12-14 13:05:48,826 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-12-14 13:05:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:05:49,062 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-12-14 13:05:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 13:05:49,063 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-12-14 13:05:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:05:49,064 INFO L225 Difference]: With dead ends: 95 [2022-12-14 13:05:49,064 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 13:05:49,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 13:05:49,065 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:05:49,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 92 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:05:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 13:05:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-14 13:05:49,088 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-12-14 13:05:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-12-14 13:05:49,089 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-12-14 13:05:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:05:49,089 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-12-14 13:05:49,090 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-12-14 13:05:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-12-14 13:05:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 13:05:49,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:49,091 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:49,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 13:05:49,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:49,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-12-14 13:05:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:49,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44471934] [2022-12-14 13:05:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:49,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:49,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550475034] [2022-12-14 13:05:49,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:05:49,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:49,328 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:49,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 13:05:49,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:05:49,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:05:49,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 13:05:49,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:49,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:05:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-12-14 13:05:49,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44471934] [2022-12-14 13:05:49,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550475034] [2022-12-14 13:05:49,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550475034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:05:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [365157248] [2022-12-14 13:05:49,895 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:05:49,895 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:05:49,895 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:05:49,896 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:05:49,896 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:05:50,145 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 13:05:50,238 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:05:51,258 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1947#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:05:51,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:05:51,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:05:51,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-12-14 13:05:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080439368] [2022-12-14 13:05:51,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:05:51,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 13:05:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:05:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 13:05:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 13:05:51,260 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-12-14 13:05:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:05:51,820 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-12-14 13:05:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-14 13:05:51,820 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-12-14 13:05:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:05:51,821 INFO L225 Difference]: With dead ends: 191 [2022-12-14 13:05:51,821 INFO L226 Difference]: Without dead ends: 185 [2022-12-14 13:05:51,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 13:05:51,822 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:05:51,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 182 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:05:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-14 13:05:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-12-14 13:05:51,851 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-12-14 13:05:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-12-14 13:05:51,852 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-12-14 13:05:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:05:51,852 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-12-14 13:05:51,852 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-12-14 13:05:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-12-14 13:05:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 13:05:51,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:05:51,854 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-12-14 13:05:51,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 13:05:52,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:52,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:05:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:05:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-12-14 13:05:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:05:52,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927666299] [2022-12-14 13:05:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:05:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:05:52,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:05:52,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369977336] [2022-12-14 13:05:52,099 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:05:52,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:05:52,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:05:52,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:05:52,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 13:05:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:05:52,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 13:05:52,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:05:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:05:52,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:05:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-12-14 13:05:53,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:05:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927666299] [2022-12-14 13:05:53,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:05:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369977336] [2022-12-14 13:05:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369977336] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:05:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1682761116] [2022-12-14 13:05:53,584 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:05:53,584 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:05:53,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:05:53,584 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:05:53,584 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:05:53,932 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 13:05:54,026 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:06:01,354 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3663#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:06:01,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:06:01,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:06:01,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-12-14 13:06:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452725234] [2022-12-14 13:06:01,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:06:01,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 13:06:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:06:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 13:06:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=2374, Unknown=1, NotChecked=0, Total=3540 [2022-12-14 13:06:01,361 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-12-14 13:06:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:06:03,772 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-12-14 13:06:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-12-14 13:06:03,773 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-12-14 13:06:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:06:03,776 INFO L225 Difference]: With dead ends: 383 [2022-12-14 13:06:03,776 INFO L226 Difference]: Without dead ends: 377 [2022-12-14 13:06:03,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3348, Invalid=7571, Unknown=1, NotChecked=0, Total=10920 [2022-12-14 13:06:03,778 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 203 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 13:06:03,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 278 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 13:06:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-12-14 13:06:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-12-14 13:06:03,829 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-12-14 13:06:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-12-14 13:06:03,831 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-12-14 13:06:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:06:03,831 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-12-14 13:06:03,831 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-12-14 13:06:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-12-14 13:06:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-12-14 13:06:03,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:06:03,836 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-12-14 13:06:03,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 13:06:04,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 13:06:04,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:06:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:06:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-12-14 13:06:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:06:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323887369] [2022-12-14 13:06:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:06:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:06:04,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:06:04,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618394808] [2022-12-14 13:06:04,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:06:04,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:06:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:06:04,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:06:04,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 13:06:42,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-12-14 13:06:42,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:06:42,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-14 13:06:42,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:06:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:06:44,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:06:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-12-14 13:06:48,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:06:48,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323887369] [2022-12-14 13:06:48,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:06:48,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618394808] [2022-12-14 13:06:48,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618394808] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:06:48,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1566541363] [2022-12-14 13:06:48,681 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:06:48,681 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:06:48,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:06:48,682 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:06:48,682 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:06:48,902 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 13:06:48,999 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:06:56,948 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7155#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:06:56,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:06:56,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:06:56,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-12-14 13:06:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52903148] [2022-12-14 13:06:56,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:06:56,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-12-14 13:06:56,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:06:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-12-14 13:06:56,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4597, Invalid=6959, Unknown=0, NotChecked=0, Total=11556 [2022-12-14 13:06:56,953 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-12-14 13:07:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:07:04,520 INFO L93 Difference]: Finished difference Result 767 states and 814 transitions. [2022-12-14 13:07:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-12-14 13:07:04,521 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-12-14 13:07:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:07:04,528 INFO L225 Difference]: With dead ends: 767 [2022-12-14 13:07:04,529 INFO L226 Difference]: Without dead ends: 761 [2022-12-14 13:07:04,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=13572, Invalid=26628, Unknown=0, NotChecked=0, Total=40200 [2022-12-14 13:07:04,542 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 452 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:07:04,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 650 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 13:07:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-12-14 13:07:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-12-14 13:07:04,727 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-12-14 13:07:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 761 transitions. [2022-12-14 13:07:04,728 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 761 transitions. Word has length 376 [2022-12-14 13:07:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:07:04,729 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 761 transitions. [2022-12-14 13:07:04,729 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-12-14 13:07:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 761 transitions. [2022-12-14 13:07:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2022-12-14 13:07:04,744 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:07:04,744 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2022-12-14 13:07:04,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 13:07:04,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 13:07:04,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:07:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:07:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1094369733, now seen corresponding path program 6 times [2022-12-14 13:07:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:07:04,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146165480] [2022-12-14 13:07:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:07:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:07:04,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:07:04,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78790817] [2022-12-14 13:07:04,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:07:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:07:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:07:04,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:07:04,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 13:07:05,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:07:05,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:07:05,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 191 conjunts are in the unsatisfiable core [2022-12-14 13:07:05,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:07:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 188 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:07:12,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:07:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 188 proven. 17672 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2022-12-14 13:07:18,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:07:18,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146165480] [2022-12-14 13:07:18,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 13:07:18,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78790817] [2022-12-14 13:07:18,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78790817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:07:18,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [591795520] [2022-12-14 13:07:18,275 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 13:07:18,275 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:07:18,275 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:07:18,275 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:07:18,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:07:18,556 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 13:07:18,632 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:07:21,252 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14109#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 13:07:21,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:07:21,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:07:21,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-12-14 13:07:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774532813] [2022-12-14 13:07:21,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 13:07:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-12-14 13:07:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:07:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-12-14 13:07:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5188, Invalid=7694, Unknown=0, NotChecked=0, Total=12882 [2022-12-14 13:07:21,257 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-12-14 13:07:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:07:29,541 INFO L93 Difference]: Finished difference Result 815 states and 820 transitions. [2022-12-14 13:07:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-12-14 13:07:29,541 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-12-14 13:07:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:07:29,544 INFO L225 Difference]: With dead ends: 815 [2022-12-14 13:07:29,544 INFO L226 Difference]: Without dead ends: 809 [2022-12-14 13:07:29,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2377 GetRequests, 2076 SyntacticMatches, 90 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11260 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=15381, Invalid=29775, Unknown=0, NotChecked=0, Total=45156 [2022-12-14 13:07:29,548 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:07:29,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 554 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 13:07:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-12-14 13:07:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2022-12-14 13:07:29,649 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-12-14 13:07:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 809 transitions. [2022-12-14 13:07:29,651 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 809 transitions. Word has length 760 [2022-12-14 13:07:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:07:29,652 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 809 transitions. [2022-12-14 13:07:29,652 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-12-14 13:07:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 809 transitions. [2022-12-14 13:07:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2022-12-14 13:07:29,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:07:29,657 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2022-12-14 13:07:29,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 13:07:29,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:07:29,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:07:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:07:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1577450477, now seen corresponding path program 7 times [2022-12-14 13:07:29,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:07:29,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079026152] [2022-12-14 13:07:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:07:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:07:29,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 13:07:29,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438198650] [2022-12-14 13:07:29,927 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:07:29,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:07:29,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:07:29,928 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:07:29,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 13:07:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:07:35,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:07:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:07:45,943 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 13:07:45,944 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:07:45,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 13:07:45,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 13:07:46,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 13:07:46,148 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-12-14 13:07:46,152 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:07:46,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:07:46 BoogieIcfgContainer [2022-12-14 13:07:46,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:07:46,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:07:46,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:07:46,283 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:07:46,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:05:15" (3/4) ... [2022-12-14 13:07:46,285 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 13:07:46,502 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 13:07:46,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:07:46,502 INFO L158 Benchmark]: Toolchain (without parser) took 151552.65ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 100.6MB in the beginning and 115.2MB in the end (delta: -14.6MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-12-14 13:07:46,502 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:07:46,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.36ms. Allocated memory is still 134.2MB. Free memory was 100.2MB in the beginning and 89.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 13:07:46,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.20ms. Allocated memory is still 134.2MB. Free memory was 89.7MB in the beginning and 88.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:07:46,503 INFO L158 Benchmark]: Boogie Preprocessor took 13.41ms. Allocated memory is still 134.2MB. Free memory was 88.1MB in the beginning and 87.2MB in the end (delta: 904.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:07:46,503 INFO L158 Benchmark]: RCFGBuilder took 260.82ms. Allocated memory is still 134.2MB. Free memory was 87.2MB in the beginning and 74.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 13:07:46,503 INFO L158 Benchmark]: TraceAbstraction took 150868.50ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 74.1MB in the beginning and 45.0MB in the end (delta: 29.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2022-12-14 13:07:46,503 INFO L158 Benchmark]: Witness Printer took 218.55ms. Allocated memory is still 201.3MB. Free memory was 45.0MB in the beginning and 115.2MB in the end (delta: -70.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-12-14 13:07:46,504 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.16ms. Allocated memory is still 134.2MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.36ms. Allocated memory is still 134.2MB. Free memory was 100.2MB in the beginning and 89.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.20ms. Allocated memory is still 134.2MB. Free memory was 89.7MB in the beginning and 88.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.41ms. Allocated memory is still 134.2MB. Free memory was 88.1MB in the beginning and 87.2MB in the end (delta: 904.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.82ms. Allocated memory is still 134.2MB. Free memory was 87.2MB in the beginning and 74.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 150868.50ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 74.1MB in the beginning and 45.0MB in the end (delta: 29.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 218.55ms. Allocated memory is still 201.3MB. Free memory was 45.0MB in the beginning and 115.2MB in the end (delta: -70.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=941362687, X=2147483647, x=0, Y=1544423167, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=941362687, X=2147483647, x=0, Y=1544423167, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=941362687, x=0, X=2147483647, x=0, x=0, Y=1544423167, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=941362687, x=0, X=2147483647, x=0, x=0, y=0, Y=1544423167] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=1, v=-264758273, x=1, x=0, X=2147483647, x=0, y=1, Y=1544423167, y++=124] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-264758273, x=1, X=2147483647, x=0, x=0, y=1, Y=1544423167, y++=124] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-264758273, x=2147483647, x=1, x=1544423167, X=2147483647, Y=1544423167, y=1, y++=124] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-264758273, X=2147483647, x=2147483647, x=1544423167, x=1, y=1, Y=1544423167, y++=124] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=2, v=2824088061, X=2147483647, x=1544423167, x=2147483647, x=2, y=1, Y=1544423167, y++=124] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=2824088061, x=2, x=1544423167, X=2147483647, x=2147483647, y=1, Y=1544423167, y++=124] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=2824088061, x=2, X=2147483647, x=3088846334, x=2147483647, y=1, Y=1544423167, y++=124] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=2824088061, X=2147483647, x=2147483647, x=2, x=3088846334, Y=1544423167, y=1, y++=124] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=3, v=1617967101, x=3088846334, x=2147483647, X=2147483647, x=3, Y=1544423167, y=2, y++=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=1617967101, x=3088846334, X=2147483647, x=2147483647, x=3, Y=1544423167, y=2, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=1617967101, X=2147483647, x=4633269501, x=4294967294, x=3, y=2, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=1617967101, x=3, x=4633269501, X=2147483647, x=4294967294, Y=1544423167, y=2, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=4, v=411846141, x=4633269501, x=4294967294, x=4, X=2147483647, Y=1544423167, y=3, y++=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=411846141, x=4294967294, X=2147483647, x=4633269501, x=4, Y=1544423167, y=3, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=411846141, x=6177692668, x=6442450941, X=2147483647, x=4, Y=1544423167, y=3, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=411846141, X=2147483647, x=4, x=6177692668, x=6442450941, Y=1544423167, y=3, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=5, v=-794274819, X=2147483647, x=6177692668, x=6442450941, x=5, y=4, Y=1544423167, y++=154] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-794274819, x=6177692668, X=2147483647, x=6442450941, x=5, Y=1544423167, y=4, y++=154] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-794274819, X=2147483647, x=5, x=7722115835, x=8589934588, Y=1544423167, y=4, y++=154] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-794274819, x=8589934588, x=5, x=7722115835, X=2147483647, y=4, Y=1544423167, y++=154] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=6, v=2294571515, x=7722115835, x=6, x=8589934588, X=2147483647, y=4, Y=1544423167, y++=154] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=2294571515, x=7722115835, x=8589934588, x=6, X=2147483647, y=4, Y=1544423167, y++=154] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=2294571515, X=2147483647, x=8589934588, x=6, x=9266539002, y=4, Y=1544423167, y++=154] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=2294571515, x=6, x=8589934588, X=2147483647, x=9266539002, y=4, Y=1544423167, y++=154] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=7, v=1088450555, X=2147483647, x=7, x=9266539002, x=8589934588, y=5, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=1088450555, x=7, x=9266539002, X=2147483647, x=8589934588, Y=1544423167, y=5, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=1088450555, x=10810962169, X=2147483647, x=7, x=10737418235, Y=1544423167, y=5, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=1088450555, X=2147483647, x=7, x=10810962169, x=10737418235, y=5, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=8, v=-117670405, X=2147483647, x=10737418235, x=10810962169, x=8, Y=1544423167, y=6, y++=179] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-117670405, x=10810962169, x=8, x=10737418235, X=2147483647, Y=1544423167, y=6, y++=179] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-117670405, x=8, x=12884901882, X=2147483647, x=12355385336, Y=1544423167, y=6, y++=179] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-117670405, X=2147483647, x=8, x=12884901882, x=12355385336, y=6, Y=1544423167, y++=179] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=9, v=2971175929, x=12355385336, X=2147483647, x=9, x=12884901882, Y=1544423167, y=6, y++=179] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=2971175929, x=9, x=12884901882, X=2147483647, x=12355385336, y=6, Y=1544423167, y++=179] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=2971175929, X=2147483647, x=12884901882, x=9, x=13899808503, y=6, Y=1544423167, y++=179] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=2971175929, X=2147483647, x=9, x=12884901882, x=13899808503, Y=1544423167, y=6, y++=179] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=10, v=1765054969, x=10, X=2147483647, x=12884901882, x=13899808503, y=7, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=1765054969, X=2147483647, x=13899808503, x=12884901882, x=10, y=7, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=1765054969, x=10, X=2147483647, x=15444231670, x=15032385529, y=7, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=1765054969, x=10, x=15444231670, x=15032385529, X=2147483647, y=7, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=11, v=558934009, x=15032385529, x=15444231670, x=11, X=2147483647, Y=1544423167, y=8, y++=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=558934009, x=15444231670, x=15032385529, X=2147483647, x=11, y=8, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=558934009, x=11, x=16988654837, x=17179869176, X=2147483647, y=8, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=558934009, x=16988654837, X=2147483647, x=17179869176, x=11, y=8, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=12, v=-647186951, x=12, x=16988654837, x=17179869176, X=2147483647, y=9, Y=1544423167, y++=210] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-647186951, x=12, x=17179869176, X=2147483647, x=16988654837, y=9, Y=1544423167, y++=210] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-647186951, x=18533078004, x=12, x=19327352823, X=2147483647, Y=1544423167, y=9, y++=210] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-647186951, X=2147483647, x=12, x=18533078004, x=19327352823, Y=1544423167, y=9, y++=210] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=13, v=2441659383, x=18533078004, x=19327352823, x=13, X=2147483647, Y=1544423167, y=9, y++=210] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=2441659383, x=19327352823, x=13, X=2147483647, x=18533078004, y=9, Y=1544423167, y++=210] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=2441659383, x=13, x=19327352823, x=20077501171, X=2147483647, y=9, Y=1544423167, y++=210] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=2441659383, x=20077501171, X=2147483647, x=19327352823, x=13, Y=1544423167, y=9, y++=210] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=14, v=1235538423, x=14, x=19327352823, X=2147483647, x=20077501171, Y=1544423167, y=10, y++=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=1235538423, x=20077501171, x=19327352823, x=14, X=2147483647, Y=1544423167, y=10, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=1235538423, x=21621924338, X=2147483647, x=14, x=21474836470, Y=1544423167, y=10, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=1235538423, x=21474836470, x=14, X=2147483647, x=21621924338, Y=1544423167, y=10, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=15, v=29417463, X=2147483647, x=15, x=21474836470, x=21621924338, Y=1544423167, y=11, y++=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=29417463, x=21474836470, x=21621924338, X=2147483647, x=15, Y=1544423167, y=11, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=29417463, x=15, x=23166347505, X=2147483647, x=23622320117, Y=1544423167, y=11, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=29417463, x=15, X=2147483647, x=23622320117, x=23166347505, y=11, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=16, v=-1176703497, x=23166347505, X=2147483647, x=23622320117, x=16, Y=1544423167, y=12, y++=242] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-1176703497, x=23622320117, x=23166347505, X=2147483647, x=16, Y=1544423167, y=12, y++=242] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-1176703497, x=24710770672, x=25769803764, X=2147483647, x=16, Y=1544423167, y=12, y++=242] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-1176703497, X=2147483647, x=16, x=24710770672, x=25769803764, Y=1544423167, y=12, y++=242] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=17, v=1912142837, x=17, x=25769803764, x=24710770672, X=2147483647, y=12, Y=1544423167, y++=242] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=1912142837, x=17, x=25769803764, X=2147483647, x=24710770672, Y=1544423167, y=12, y++=242] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=1912142837, x=26255193839, X=2147483647, x=25769803764, x=17, y=12, Y=1544423167, y++=242] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=1912142837, x=26255193839, X=2147483647, x=17, x=25769803764, y=12, Y=1544423167, y++=242] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=18, v=706021877, x=26255193839, X=2147483647, x=18, x=25769803764, y=13, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=706021877, x=26255193839, x=18, X=2147483647, x=25769803764, Y=1544423167, y=13, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=706021877, x=27799617006, x=18, x=27917287411, X=2147483647, y=13, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=706021877, x=18, X=2147483647, x=27917287411, x=27799617006, Y=1544423167, y=13, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=19, v=-500099083, x=27917287411, x=27799617006, X=2147483647, x=19, y=14, Y=1544423167, y++=268] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-500099083, x=19, x=27917287411, x=27799617006, X=2147483647, Y=1544423167, y=14, y++=268] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-500099083, x=29344040173, x=30064771058, x=19, X=2147483647, y=14, Y=1544423167, y++=268] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-500099083, x=30064771058, x=29344040173, X=2147483647, x=19, y=14, Y=1544423167, y++=268] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=20, v=2588747251, x=29344040173, x=20, X=2147483647, x=30064771058, y=14, Y=1544423167, y++=268] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=2588747251, x=29344040173, x=30064771058, x=20, X=2147483647, Y=1544423167, y=14, y++=268] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=2588747251, x=30888463340, x=20, X=2147483647, x=30064771058, Y=1544423167, y=14, y++=268] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=2588747251, x=30064771058, x=30888463340, x=20, X=2147483647, y=14, Y=1544423167, y++=268] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=21, v=1382626291, x=21, x=30888463340, X=2147483647, x=30064771058, y=15, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=1382626291, X=2147483647, x=30888463340, x=30064771058, x=21, y=15, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=1382626291, X=2147483647, x=32212254705, x=32432886507, x=21, Y=1544423167, y=15, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=1382626291, x=32432886507, X=2147483647, x=21, x=32212254705, Y=1544423167, y=15, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=22, v=176505331, X=2147483647, x=32212254705, x=22, x=32432886507, y=16, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=176505331, x=22, x=32432886507, X=2147483647, x=32212254705, Y=1544423167, y=16, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=176505331, X=2147483647, x=33977309674, x=22, x=34359738352, y=16, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=176505331, X=2147483647, x=33977309674, x=34359738352, x=22, Y=1544423167, y=16, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=23, v=-1029615629, x=34359738352, x=33977309674, X=2147483647, x=23, Y=1544423167, y=17, y++=300] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-1029615629, X=2147483647, x=33977309674, x=23, x=34359738352, Y=1544423167, y=17, y++=300] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-1029615629, x=36507221999, x=23, x=35521732841, X=2147483647, Y=1544423167, y=17, y++=300] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-1029615629, x=36507221999, x=23, X=2147483647, x=35521732841, Y=1544423167, y=17, y++=300] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=24, v=2059230705, x=36507221999, X=2147483647, x=35521732841, x=24, Y=1544423167, y=17, y++=300] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=2059230705, x=35521732841, x=36507221999, x=24, X=2147483647, Y=1544423167, y=17, y++=300] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=2059230705, x=36507221999, X=2147483647, x=24, x=37066156008, y=17, Y=1544423167, y++=300] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=2059230705, x=24, x=37066156008, x=36507221999, X=2147483647, Y=1544423167, y=17, y++=300] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=25, v=853109745, x=36507221999, x=37066156008, x=25, X=2147483647, Y=1544423167, y=18, y++=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=853109745, x=36507221999, x=25, X=2147483647, x=37066156008, Y=1544423167, y=18, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=853109745, X=2147483647, x=38610579175, x=25, x=38654705646, y=18, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=853109745, x=38610579175, X=2147483647, x=25, x=38654705646, Y=1544423167, y=18, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=26, v=-353011215, X=2147483647, x=38610579175, x=26, x=38654705646, Y=1544423167, y=19, y++=326] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-353011215, x=38654705646, x=38610579175, X=2147483647, x=26, Y=1544423167, y=19, y++=326] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-353011215, X=2147483647, x=40802189293, x=26, x=40155002342, Y=1544423167, y=19, y++=326] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-353011215, x=40155002342, X=2147483647, x=26, x=40802189293, y=19, Y=1544423167, y++=326] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=27, v=2735835119, x=40155002342, x=27, X=2147483647, x=40802189293, Y=1544423167, y=19, y++=326] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=2735835119, x=27, X=2147483647, x=40155002342, x=40802189293, Y=1544423167, y=19, y++=326] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=2735835119, x=40802189293, x=41699425509, x=27, X=2147483647, y=19, Y=1544423167, y++=326] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=2735835119, x=41699425509, x=27, X=2147483647, x=40802189293, y=19, Y=1544423167, y++=326] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=28, v=1529714159, x=40802189293, x=41699425509, X=2147483647, x=28, y=20, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=1529714159, x=40802189293, x=28, x=41699425509, X=2147483647, y=20, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=1529714159, x=43243848676, X=2147483647, x=28, x=42949672940, Y=1544423167, y=20, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=1529714159, X=2147483647, x=42949672940, x=28, x=43243848676, y=20, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=29, v=323593199, x=29, X=2147483647, x=43243848676, x=42949672940, y=21, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=323593199, x=42949672940, X=2147483647, x=29, x=43243848676, y=21, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=323593199, x=29, X=2147483647, x=44788271843, x=45097156587, y=21, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=323593199, X=2147483647, x=44788271843, x=29, x=45097156587, Y=1544423167, y=21, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=30, v=-882527761, x=30, x=44788271843, X=2147483647, x=45097156587, y=22, Y=1544423167, y++=356] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-882527761, x=44788271843, x=45097156587, X=2147483647, x=30, y=22, Y=1544423167, y++=356] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-882527761, x=47244640234, X=2147483647, x=30, x=46332695010, Y=1544423167, y=22, y++=356] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-882527761, x=30, X=2147483647, x=46332695010, x=47244640234, y=22, Y=1544423167, y++=356] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=31, v=2206318573, X=2147483647, x=47244640234, x=46332695010, x=31, y=22, Y=1544423167, y++=356] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=2206318573, x=46332695010, x=47244640234, x=31, X=2147483647, Y=1544423167, y=22, y++=356] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=2206318573, x=47244640234, x=31, X=2147483647, x=47877118177, y=22, Y=1544423167, y++=356] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=2206318573, x=47877118177, X=2147483647, x=31, x=47244640234, y=22, Y=1544423167, y++=356] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=32, v=1000197613, X=2147483647, x=32, x=47244640234, x=47877118177, y=23, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=1000197613, x=47244640234, x=47877118177, X=2147483647, x=32, Y=1544423167, y=23, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=1000197613, x=49421541344, x=49392123881, X=2147483647, x=32, y=23, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=1000197613, x=32, x=49421541344, x=49392123881, X=2147483647, Y=1544423167, y=23, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=33, v=-205923347, x=49421541344, x=49392123881, X=2147483647, x=33, y=24, Y=1544423167, y++=380] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-205923347, x=33, x=49421541344, x=49392123881, X=2147483647, Y=1544423167, y=24, y++=380] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-205923347, x=33, X=2147483647, x=51539607528, x=50965964511, Y=1544423167, y=24, y++=380] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-205923347, X=2147483647, x=33, x=51539607528, x=50965964511, Y=1544423167, y=24, y++=380] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=34, v=2882922987, X=2147483647, x=51539607528, x=50965964511, x=34, Y=1544423167, y=24, y++=380] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=2882922987, x=34, x=51539607528, x=50965964511, X=2147483647, Y=1544423167, y=24, y++=380] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=2882922987, x=34, X=2147483647, x=51539607528, x=52510387678, y=24, Y=1544423167, y++=380] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=2882922987, X=2147483647, x=51539607528, x=52510387678, x=34, y=24, Y=1544423167, y++=380] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=35, v=1676802027, x=52510387678, X=2147483647, x=35, x=51539607528, y=25, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=1676802027, x=35, x=51539607528, X=2147483647, x=52510387678, Y=1544423167, y=25, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=1676802027, x=35, X=2147483647, x=54054810845, x=53687091175, y=25, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=1676802027, x=53687091175, x=54054810845, X=2147483647, x=35, y=25, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=36, v=470681067, x=53687091175, x=54054810845, X=2147483647, x=36, Y=1544423167, y=26, y++=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=470681067, X=2147483647, x=36, x=53687091175, x=54054810845, y=26, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=470681067, x=55599234012, X=2147483647, x=55834574822, x=36, Y=1544423167, y=26, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=470681067, x=55599234012, x=36, x=55834574822, X=2147483647, y=26, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=37, v=-735439893, x=55599234012, x=37, X=2147483647, x=55834574822, y=27, Y=1544423167, y++=412] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-735439893, x=37, x=55599234012, X=2147483647, x=55834574822, y=27, Y=1544423167, y++=412] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-735439893, x=57982058469, X=2147483647, x=37, x=57143657179, y=27, Y=1544423167, y++=412] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-735439893, x=57982058469, X=2147483647, x=37, x=57143657179, Y=1544423167, y=27, y++=412] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=38, v=2353406441, x=57143657179, x=57982058469, x=38, X=2147483647, y=27, Y=1544423167, y++=412] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=2353406441, x=57982058469, X=2147483647, x=57143657179, x=38, y=27, Y=1544423167, y++=412] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=2353406441, x=38, x=57982058469, X=2147483647, x=58688080346, y=27, Y=1544423167, y++=412] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=2353406441, x=57982058469, x=58688080346, x=38, X=2147483647, y=27, Y=1544423167, y++=412] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=39, v=1147285481, x=39, x=57982058469, x=58688080346, X=2147483647, Y=1544423167, y=28, y++=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=1147285481, X=2147483647, x=39, x=58688080346, x=57982058469, Y=1544423167, y=28, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=1147285481, x=60232503513, x=39, X=2147483647, x=60129542116, y=28, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=1147285481, x=60129542116, X=2147483647, x=60232503513, x=39, Y=1544423167, y=28, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=40, v=-58835479, X=2147483647, x=40, x=60232503513, x=60129542116, y=29, Y=1544423167, y++=436] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-58835479, X=2147483647, x=60129542116, x=40, x=60232503513, y=29, Y=1544423167, y++=436] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-58835479, x=61776926680, x=40, X=2147483647, x=62277025763, Y=1544423167, y=29, y++=436] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-58835479, x=40, x=62277025763, X=2147483647, x=61776926680, y=29, Y=1544423167, y++=436] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=41, v=3030010855, X=2147483647, x=61776926680, x=62277025763, x=41, Y=1544423167, y=29, y++=436] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=3030010855, x=41, x=62277025763, X=2147483647, x=61776926680, Y=1544423167, y=29, y++=436] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=3030010855, x=63321349847, x=41, x=62277025763, X=2147483647, Y=1544423167, y=29, y++=436] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=3030010855, x=62277025763, x=63321349847, X=2147483647, x=41, Y=1544423167, y=29, y++=436] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=42, v=1823889895, x=62277025763, x=42, X=2147483647, x=63321349847, y=30, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=1823889895, x=63321349847, x=42, x=62277025763, X=2147483647, y=30, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=1823889895, x=42, x=64424509410, x=64865773014, X=2147483647, Y=1544423167, y=30, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=1823889895, x=42, x=64865773014, x=64424509410, X=2147483647, y=30, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=43, v=617768935, x=64865773014, x=43, x=64424509410, X=2147483647, Y=1544423167, y=31, y++=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=617768935, x=64424509410, x=43, x=64865773014, X=2147483647, Y=1544423167, y=31, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=617768935, x=66571993057, x=43, X=2147483647, x=66410196181, y=31, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=617768935, x=43, X=2147483647, x=66410196181, x=66571993057, Y=1544423167, y=31, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=44, v=-588352025, x=66571993057, x=66410196181, X=2147483647, x=44, y=32, Y=1544423167, y++=468] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-588352025, x=66571993057, X=2147483647, x=66410196181, x=44, Y=1544423167, y=32, y++=468] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-588352025, x=68719476704, x=44, X=2147483647, x=67954619348, y=32, Y=1544423167, y++=468] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-588352025, x=68719476704, x=44, x=67954619348, X=2147483647, y=32, Y=1544423167, y++=468] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=45, v=2500494309, x=68719476704, X=2147483647, x=67954619348, x=45, y=32, Y=1544423167, y++=468] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=2500494309, x=45, x=67954619348, X=2147483647, x=68719476704, Y=1544423167, y=32, y++=468] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=2500494309, X=2147483647, x=68719476704, x=69499042515, x=45, y=32, Y=1544423167, y++=468] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=2500494309, x=45, x=68719476704, X=2147483647, x=69499042515, Y=1544423167, y=32, y++=468] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=46, v=1294373349, x=68719476704, x=46, x=69499042515, X=2147483647, Y=1544423167, y=33, y++=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=1294373349, x=68719476704, x=69499042515, x=46, X=2147483647, Y=1544423167, y=33, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=1294373349, x=71043465682, x=46, X=2147483647, x=70866960351, Y=1544423167, y=33, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=1294373349, x=71043465682, x=46, x=70866960351, X=2147483647, y=33, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=47, v=88252389, x=71043465682, X=2147483647, x=70866960351, x=47, Y=1544423167, y=34, y++=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=88252389, x=47, X=2147483647, x=71043465682, x=70866960351, Y=1544423167, y=34, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=88252389, x=47, x=73014443998, X=2147483647, x=72587888849, y=34, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=88252389, x=73014443998, X=2147483647, x=47, x=72587888849, y=34, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=48, v=-1117868571, X=2147483647, x=48, x=72587888849, x=73014443998, y=35, Y=1544423167, y++=500] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1117868571, x=73014443998, X=2147483647, x=48, x=72587888849, y=35, Y=1544423167, y++=500] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1117868571, x=74132312016, x=75161927645, x=48, X=2147483647, y=35, Y=1544423167, y++=500] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1117868571, x=48, X=2147483647, x=74132312016, x=75161927645, Y=1544423167, y=35, y++=500] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=49, v=1970977763, X=2147483647, x=74132312016, x=75161927645, x=49, y=35, Y=1544423167, y++=500] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=1970977763, X=2147483647, x=74132312016, x=75161927645, x=49, y=35, Y=1544423167, y++=500] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=1970977763, x=49, X=2147483647, x=75161927645, x=75676735183, y=35, Y=1544423167, y++=500] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=1970977763, X=2147483647, x=75161927645, x=49, x=75676735183, Y=1544423167, y=35, y++=500] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=50, v=764856803, x=75161927645, x=50, x=75676735183, X=2147483647, Y=1544423167, y=36, y++=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=764856803, X=2147483647, x=75676735183, x=75161927645, x=50, y=36, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=764856803, x=50, X=2147483647, x=77309411292, x=77221158350, y=36, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=51, v=764856803, x=50, x=77221158350, X=2147483647, x=77309411292, y=36, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=51, v=-441264157, x=51, x=77221158350, x=77309411292, X=2147483647, y=37, Y=1544423167, y++=527] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-441264157, x=77309411292, x=77221158350, x=51, X=2147483647, Y=1544423167, y=37, y++=527] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-441264157, X=2147483647, x=51, x=78765581517, x=79456894939, y=37, Y=1544423167, y++=527] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=52, v=-441264157, X=2147483647, x=78765581517, x=79456894939, x=51, Y=1544423167, y=37, y++=527] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=52, v=2647582177, X=2147483647, x=79456894939, x=78765581517, x=52, y=37, Y=1544423167, y++=527] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=2647582177, X=2147483647, x=78765581517, x=79456894939, x=52, Y=1544423167, y=37, y++=527] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=2647582177, X=2147483647, x=52, x=80310004684, x=79456894939, Y=1544423167, y=37, y++=527] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=53, v=2647582177, X=2147483647, x=52, x=79456894939, x=80310004684, Y=1544423167, y=37, y++=527] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=53, v=1441461217, x=53, X=2147483647, x=79456894939, x=80310004684, y=38, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=1441461217, x=79456894939, x=53, x=80310004684, X=2147483647, y=38, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=1441461217, x=53, X=2147483647, x=81604378586, x=81854427851, Y=1544423167, y=38, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=54, v=1441461217, x=81604378586, x=81854427851, X=2147483647, x=53, y=38, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=54, v=235340257, x=81854427851, x=81604378586, x=54, X=2147483647, Y=1544423167, y=39, y++=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=235340257, x=54, x=81604378586, x=81854427851, X=2147483647, Y=1544423167, y=39, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=235340257, x=83398851018, x=54, X=2147483647, x=83751862233, Y=1544423167, y=39, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=55, v=235340257, x=54, x=83751862233, x=83398851018, X=2147483647, Y=1544423167, y=39, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=55, v=-970780703, x=83398851018, X=2147483647, x=83751862233, x=55, y=40, Y=1544423167, y++=559] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-970780703, x=83751862233, x=83398851018, X=2147483647, x=55, Y=1544423167, y=40, y++=559] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-970780703, x=85899345880, x=84943274185, x=55, X=2147483647, Y=1544423167, y=40, y++=559] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=56, v=-970780703, x=85899345880, x=55, X=2147483647, x=84943274185, Y=1544423167, y=40, y++=559] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=56, v=2118065631, x=85899345880, x=56, x=84943274185, X=2147483647, y=40, Y=1544423167, y++=559] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=2118065631, x=85899345880, x=84943274185, x=56, X=2147483647, Y=1544423167, y=40, y++=559] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=2118065631, X=2147483647, x=56, x=85899345880, x=86487697352, y=40, Y=1544423167, y++=559] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=57, v=2118065631, x=56, x=85899345880, x=86487697352, X=2147483647, Y=1544423167, y=40, y++=559] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=57, v=911944671, x=57, x=86487697352, X=2147483647, x=85899345880, y=41, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=911944671, x=86487697352, x=85899345880, x=57, X=2147483647, y=41, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=911944671, x=88032120519, x=88046829527, X=2147483647, x=57, Y=1544423167, y=41, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=911944671, x=88032120519, x=88046829527, x=57, X=2147483647, y=41, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=58, v=-294176289, x=88032120519, X=2147483647, x=88046829527, x=58, Y=1544423167, y=42, y++=582] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-294176289, x=58, x=88032120519, x=88046829527, X=2147483647, Y=1544423167, y=42, y++=582] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-294176289, x=89576543686, x=90194313174, X=2147483647, x=58, y=42, Y=1544423167, y++=582] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=59, v=-294176289, x=90194313174, x=89576543686, x=58, X=2147483647, Y=1544423167, y=42, y++=582] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=59, v=2794670045, x=89576543686, x=90194313174, x=59, X=2147483647, Y=1544423167, y=42, y++=582] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=2794670045, x=89576543686, x=90194313174, X=2147483647, x=59, Y=1544423167, y=42, y++=582] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=2794670045, x=90194313174, x=91120966853, X=2147483647, x=59, y=42, Y=1544423167, y++=582] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=60, v=2794670045, x=59, x=90194313174, x=91120966853, X=2147483647, Y=1544423167, y=42, y++=582] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=60, v=1588549085, x=90194313174, x=91120966853, x=60, X=2147483647, y=43, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=1588549085, x=60, X=2147483647, x=91120966853, x=90194313174, Y=1544423167, y=43, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=1588549085, X=2147483647, x=92665390020, x=92341796821, x=60, y=43, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=61, v=1588549085, x=92665390020, x=92341796821, X=2147483647, x=60, Y=1544423167, y=43, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=61, v=382428125, x=61, x=92341796821, x=92665390020, X=2147483647, Y=1544423167, y=44, y++=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=382428125, x=92341796821, X=2147483647, x=61, x=92665390020, Y=1544423167, y=44, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=382428125, x=94209813187, x=94489280468, x=61, X=2147483647, Y=1544423167, y=44, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=62, v=382428125, x=94489280468, x=94209813187, x=61, X=2147483647, y=44, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=62, v=-823692835, x=94209813187, X=2147483647, x=62, x=94489280468, y=45, Y=1544423167, y++=615] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-823692835, x=94209813187, x=94489280468, X=2147483647, x=62, Y=1544423167, y=45, y++=615] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-823692835, x=96636764115, x=62, X=2147483647, x=95754236354, y=45, Y=1544423167, y++=615] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=63, v=-823692835, x=62, X=2147483647, x=95754236354, x=96636764115, y=45, Y=1544423167, y++=615] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=63, v=2265153499, x=95754236354, X=2147483647, x=96636764115, x=63, Y=1544423167, y=45, y++=615] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=2265153499, x=95754236354, X=2147483647, x=63, x=96636764115, Y=1544423167, y=45, y++=615] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=2265153499, X=2147483647, x=63, x=96636764115, x=97298659521, y=45, Y=1544423167, y++=615] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=64, v=2265153499, X=2147483647, x=96636764115, x=63, x=97298659521, Y=1544423167, y=45, y++=615] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=64, v=1059032539, X=2147483647, x=64, x=97298659521, x=96636764115, y=46, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=1059032539, x=97298659521, X=2147483647, x=96636764115, x=64, Y=1544423167, y=46, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=1059032539, X=2147483647, x=64, x=98784247762, x=98843082688, Y=1544423167, y=46, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=65, v=1059032539, x=98843082688, X=2147483647, x=98784247762, x=64, y=46, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=65, v=-147088421, x=65, x=98784247762, x=98843082688, X=2147483647, Y=1544423167, y=47, y++=638] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-147088421, x=65, x=98843082688, X=2147483647, x=98784247762, y=47, Y=1544423167, y++=638] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-147088421, x=100387505855, X=2147483647, x=65, x=100931731409, Y=1544423167, y=47, y++=638] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=66, v=-147088421, x=100931731409, X=2147483647, x=100387505855, x=65, y=47, Y=1544423167, y++=638] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=66, v=2941757913, x=100931731409, x=100387505855, x=66, X=2147483647, Y=1544423167, y=47, y++=638] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=2941757913, X=2147483647, x=66, x=100931731409, x=100387505855, y=47, Y=1544423167, y++=638] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=2941757913, X=2147483647, x=66, x=100931731409, x=101931929022, y=47, Y=1544423167, y++=638] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=67, v=2941757913, x=66, x=100931731409, x=101931929022, X=2147483647, y=47, Y=1544423167, y++=638] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=67, v=1735636953, x=101931929022, X=2147483647, x=100931731409, x=67, Y=1544423167, y=48, y++=0] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=1735636953, X=2147483647, x=67, x=100931731409, x=101931929022, y=48, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=1735636953, x=67, x=103079215056, x=103476352189, X=2147483647, Y=1544423167, y=48, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=68, v=1735636953, x=67, X=2147483647, x=103079215056, x=103476352189, y=48, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=68, v=529515993, X=2147483647, x=103079215056, x=103476352189, x=68, Y=1544423167, y=49, y++=0] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=529515993, x=103476352189, X=2147483647, x=68, x=103079215056, y=49, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=529515993, X=2147483647, x=105226698703, x=105020775356, x=68, Y=1544423167, y=49, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=69, v=529515993, X=2147483647, x=105020775356, x=68, x=105226698703, Y=1544423167, y=49, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=69, v=-676604967, x=69, x=105020775356, x=105226698703, X=2147483647, Y=1544423167, y=50, y++=672] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-676604967, x=105020775356, x=69, X=2147483647, x=105226698703, Y=1544423167, y=50, y++=672] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-676604967, x=106565198523, x=107374182350, x=69, X=2147483647, y=50, Y=1544423167, y++=672] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=70, v=-676604967, x=107374182350, x=106565198523, x=69, X=2147483647, y=50, Y=1544423167, y++=672] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=70, v=2412241367, x=106565198523, X=2147483647, x=70, x=107374182350, Y=1544423167, y=50, y++=672] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=2412241367, X=2147483647, x=106565198523, x=70, x=107374182350, y=50, Y=1544423167, y++=672] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=2412241367, x=70, x=108109621690, X=2147483647, x=107374182350, y=50, Y=1544423167, y++=672] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=71, v=2412241367, X=2147483647, x=108109621690, x=70, x=107374182350, y=50, Y=1544423167, y++=672] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=71, v=1206120407, x=107374182350, x=108109621690, x=71, X=2147483647, y=51, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=1206120407, X=2147483647, x=108109621690, x=71, x=107374182350, Y=1544423167, y=51, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=1206120407, X=2147483647, x=71, x=109521665997, x=109654044857, Y=1544423167, y=51, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=72, v=1206120407, x=109521665997, x=109654044857, X=2147483647, x=71, y=51, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=72, v=-553, x=109521665997, X=2147483647, x=109654044857, x=72, Y=1544423167, y=52, y++=695] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-553, x=72, x=109654044857, X=2147483647, x=109521665997, y=52, Y=1544423167, y++=695] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-553, x=72, X=2147483647, x=111669149644, x=111198468024, y=52, Y=1544423167, y++=695] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=73, v=-553, x=111198468024, X=2147483647, x=111669149644, x=72, Y=1544423167, y=52, y++=695] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=73, v=3088845781, x=111669149644, x=111198468024, X=2147483647, x=73, y=52, Y=1544423167, y++=695] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=3088845781, x=73, x=111669149644, X=2147483647, x=111198468024, y=52, Y=1544423167, y++=695] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=3088845781, x=112742891191, x=73, x=111669149644, X=2147483647, y=52, Y=1544423167, y++=695] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=74, v=3088845781, x=111669149644, X=2147483647, x=112742891191, x=73, Y=1544423167, y=52, y++=695] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=74, v=1882724821, x=112742891191, X=2147483647, x=111669149644, x=74, Y=1544423167, y=53, y++=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=1882724821, x=111669149644, x=112742891191, x=74, X=2147483647, Y=1544423167, y=53, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=1882724821, x=74, X=2147483647, x=113816633291, x=114287314358, y=53, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=75, v=1882724821, X=2147483647, x=113816633291, x=74, x=114287314358, Y=1544423167, y=53, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=75, v=676603861, x=113816633291, x=75, X=2147483647, x=114287314358, y=54, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=676603861, x=113816633291, x=114287314358, x=75, X=2147483647, Y=1544423167, y=54, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=676603861, X=2147483647, x=115964116938, x=115831737525, x=75, y=54, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=76, v=676603861, x=115964116938, X=2147483647, x=115831737525, x=75, y=54, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=76, v=-529517099, x=76, x=115831737525, x=115964116938, X=2147483647, y=55, Y=1544423167, y++=728] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-529517099, x=76, X=2147483647, x=115831737525, x=115964116938, Y=1544423167, y=55, y++=728] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-529517099, X=2147483647, x=117376160692, x=118111600585, x=76, y=55, Y=1544423167, y++=728] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=77, v=-529517099, x=117376160692, X=2147483647, x=76, x=118111600585, Y=1544423167, y=55, y++=728] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=77, v=2559329235, X=2147483647, x=117376160692, x=118111600585, x=77, Y=1544423167, y=55, y++=728] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=2559329235, x=77, x=117376160692, X=2147483647, x=118111600585, Y=1544423167, y=55, y++=728] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=2559329235, X=2147483647, x=118920583859, x=77, x=118111600585, y=55, Y=1544423167, y++=728] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=78, v=2559329235, x=77, x=118111600585, x=118920583859, X=2147483647, Y=1544423167, y=55, y++=728] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=78, v=1353208275, x=78, x=118111600585, X=2147483647, x=118920583859, Y=1544423167, y=56, y++=0] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=1353208275, x=118920583859, x=118111600585, x=78, X=2147483647, y=56, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=1353208275, x=78, x=120465007026, X=2147483647, x=120259084232, Y=1544423167, y=56, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=79, v=1353208275, X=2147483647, x=120259084232, x=78, x=120465007026, y=56, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=79, v=147087315, x=120465007026, x=79, x=120259084232, X=2147483647, y=57, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=147087315, X=2147483647, x=120259084232, x=120465007026, x=79, y=57, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=147087315, x=79, x=122406567879, X=2147483647, x=122009430193, Y=1544423167, y=57, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=80, v=147087315, x=79, x=122009430193, x=122406567879, X=2147483647, y=57, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=80, v=-1059033645, X=2147483647, x=80, x=122009430193, x=122406567879, Y=1544423167, y=58, y++=761] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-1059033645, x=122406567879, x=80, x=122009430193, X=2147483647, y=58, Y=1544423167, y++=761] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-1059033645, x=123553853360, x=80, x=124554051526, X=2147483647, y=58, Y=1544423167, y++=761] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=81, v=-1059033645, x=124554051526, x=80, x=123553853360, X=2147483647, Y=1544423167, y=58, y++=761] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=81, v=2029812689, x=123553853360, x=81, X=2147483647, x=124554051526, y=58, Y=1544423167, y++=761] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=2029812689, x=124554051526, x=123553853360, X=2147483647, x=81, Y=1544423167, y=58, y++=761] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=2029812689, x=125098276527, X=2147483647, x=124554051526, x=81, Y=1544423167, y=58, y++=761] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=82, v=2029812689, x=125098276527, x=124554051526, x=81, X=2147483647, Y=1544423167, y=58, y++=761] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=82, v=823691729, x=124554051526, x=82, x=125098276527, X=2147483647, Y=1544423167, y=59, y++=0] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=823691729, x=124554051526, X=2147483647, x=82, x=125098276527, Y=1544423167, y=59, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=823691729, x=126642699694, x=126701535173, x=82, X=2147483647, Y=1544423167, y=59, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=83, v=823691729, x=82, x=126701535173, X=2147483647, x=126642699694, y=59, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=83, v=-382429231, x=126701535173, x=83, x=126642699694, X=2147483647, Y=1544423167, y=60, y++=782] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-382429231, x=126642699694, X=2147483647, x=83, x=126701535173, Y=1544423167, y=60, y++=782] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-382429231, x=128187122861, X=2147483647, x=83, x=128849018820, y=60, Y=1544423167, y++=782] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=84, v=-382429231, x=128187122861, X=2147483647, x=83, x=128849018820, y=60, Y=1544423167, y++=782] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=84, v=2706417103, x=128849018820, X=2147483647, x=128187122861, x=84, Y=1544423167, y=60, y++=782] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=2706417103, x=128187122861, x=128849018820, x=84, X=2147483647, Y=1544423167, y=60, y++=782] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=2706417103, X=2147483647, x=84, x=129731546028, x=128849018820, Y=1544423167, y=60, y++=782] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=85, v=2706417103, x=84, X=2147483647, x=129731546028, x=128849018820, Y=1544423167, y=60, y++=782] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=85, v=1500296143, x=85, X=2147483647, x=128849018820, x=129731546028, Y=1544423167, y=61, y++=0] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=1500296143, x=129731546028, x=85, x=128849018820, X=2147483647, y=61, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=1500296143, x=85, x=130996502467, X=2147483647, x=131275969195, y=61, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=86, v=1500296143, X=2147483647, x=130996502467, x=131275969195, x=85, y=61, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=86, v=294175183, x=130996502467, x=86, X=2147483647, x=131275969195, Y=1544423167, y=62, y++=0] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=294175183, X=2147483647, x=130996502467, x=86, x=131275969195, Y=1544423167, y=62, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=294175183, x=133143986114, x=132820392362, x=86, X=2147483647, Y=1544423167, y=62, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=87, v=294175183, x=133143986114, x=86, X=2147483647, x=132820392362, y=62, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=87, v=-911945777, X=2147483647, x=133143986114, x=132820392362, x=87, Y=1544423167, y=63, y++=816] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-911945777, x=132820392362, x=133143986114, X=2147483647, x=87, y=63, Y=1544423167, y++=816] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-911945777, x=135291469761, X=2147483647, x=134364815529, x=87, y=63, Y=1544423167, y++=816] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=88, v=-911945777, x=87, x=134364815529, x=135291469761, X=2147483647, y=63, Y=1544423167, y++=816] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=88, v=2176900557, x=135291469761, x=134364815529, x=88, X=2147483647, y=63, Y=1544423167, y++=816] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=2176900557, x=134364815529, X=2147483647, x=88, x=135291469761, y=63, Y=1544423167, y++=816] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=2176900557, X=2147483647, x=135291469761, x=88, x=135909238696, y=63, Y=1544423167, y++=816] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=89, v=2176900557, x=88, x=135909238696, x=135291469761, X=2147483647, y=63, Y=1544423167, y++=816] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=89, v=970779597, x=135291469761, x=89, X=2147483647, x=135909238696, y=64, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=970779597, x=89, x=135291469761, x=135909238696, X=2147483647, y=64, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=970779597, x=89, x=137438953408, X=2147483647, x=137453661863, y=64, Y=1544423167, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=90, v=970779597, x=137438953408, x=137453661863, x=89, X=2147483647, Y=1544423167, y=64, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=90, v=-235341363, x=137438953408, x=137453661863, X=2147483647, x=90, Y=1544423167, y=65, y++=841] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-235341363, x=137438953408, X=2147483647, x=90, x=137453661863, Y=1544423167, y=65, y++=841] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-235341363, x=139586437055, x=138998085030, x=90, X=2147483647, y=65, Y=1544423167, y++=841] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=91, v=-235341363, x=90, X=2147483647, x=139586437055, x=138998085030, Y=1544423167, y=65, y++=841] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=91, v=2853504971, x=91, x=139586437055, X=2147483647, x=138998085030, y=65, Y=1544423167, y++=841] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=2853504971, x=138998085030, x=91, X=2147483647, x=139586437055, y=65, Y=1544423167, y++=841] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=2853504971, x=140542508197, x=139586437055, X=2147483647, x=91, y=65, Y=1544423167, y++=841] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=92, v=2853504971, x=91, X=2147483647, x=140542508197, x=139586437055, Y=1544423167, y=65, y++=841] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=92, v=1647384011, X=2147483647, x=140542508197, x=92, x=139586437055, y=66, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=1647384011, x=139586437055, x=92, X=2147483647, x=140542508197, y=66, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=1647384011, x=142086931364, x=141733920702, X=2147483647, x=92, Y=1544423167, y=66, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=93, v=1647384011, x=141733920702, X=2147483647, x=92, x=142086931364, Y=1544423167, y=66, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=93, v=441263051, X=2147483647, x=142086931364, x=141733920702, x=93, Y=1544423167, y=67, y++=0] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=441263051, x=141733920702, x=142086931364, x=93, X=2147483647, y=67, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=441263051, x=143881404349, x=143631354531, x=93, X=2147483647, Y=1544423167, y=67, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=94, v=441263051, x=143631354531, x=93, x=143881404349, X=2147483647, Y=1544423167, y=67, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=94, v=-764857909, x=94, x=143881404349, X=2147483647, x=143631354531, y=68, Y=1544423167, y++=873] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-764857909, X=2147483647, x=143631354531, x=143881404349, x=94, y=68, Y=1544423167, y++=873] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-764857909, x=146028887996, x=94, x=145175777698, X=2147483647, Y=1544423167, y=68, y++=873] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=95, v=-764857909, x=146028887996, x=145175777698, x=94, X=2147483647, y=68, Y=1544423167, y++=873] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=95, v=2323988425, x=95, X=2147483647, x=146028887996, x=145175777698, Y=1544423167, y=68, y++=873] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=2323988425, x=146028887996, X=2147483647, x=95, x=145175777698, y=68, Y=1544423167, y++=873] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=2323988425, X=2147483647, x=95, x=146720200865, x=146028887996, Y=1544423167, y=68, y++=873] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=96, v=2323988425, x=146720200865, x=146028887996, X=2147483647, x=95, y=68, Y=1544423167, y++=873] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=96, v=1117867465, X=2147483647, x=96, x=146720200865, x=146028887996, y=69, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=1117867465, X=2147483647, x=146028887996, x=96, x=146720200865, y=69, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=1117867465, x=148176371643, x=148264624032, x=96, X=2147483647, Y=1544423167, y=69, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=97, v=1117867465, x=148264624032, X=2147483647, x=148176371643, x=96, y=69, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=97, v=-88253495, x=148176371643, x=97, x=148264624032, X=2147483647, y=70, Y=1544423167, y++=897] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-88253495, X=2147483647, x=148264624032, x=97, x=148176371643, y=70, Y=1544423167, y++=897] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-88253495, x=149809047199, x=97, X=2147483647, x=150323855290, y=70, Y=1544423167, y++=897] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=98, v=-88253495, X=2147483647, x=97, x=150323855290, x=149809047199, y=70, Y=1544423167, y++=897] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=98, v=3000592839, x=149809047199, X=2147483647, x=98, x=150323855290, Y=1544423167, y=70, y++=897] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=3000592839, x=150323855290, x=98, x=149809047199, X=2147483647, y=70, Y=1544423167, y++=897] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=3000592839, x=98, x=151353470366, X=2147483647, x=150323855290, y=70, Y=1544423167, y++=897] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=99, v=3000592839, X=2147483647, x=150323855290, x=151353470366, x=98, y=70, Y=1544423167, y++=897] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=99, v=1794471879, x=150323855290, X=2147483647, x=99, x=151353470366, Y=1544423167, y=71, y++=0] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=1794471879, X=2147483647, x=150323855290, x=99, x=151353470366, y=71, Y=1544423167, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=1794471879, X=2147483647, x=152471338937, x=152897893533, x=99, Y=1544423167, y=71, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=100, v=1794471879, x=99, x=152471338937, x=152897893533, X=2147483647, y=71, Y=1544423167, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=100, v=588350919, x=152897893533, x=100, x=152471338937, X=2147483647, y=72, Y=1544423167, y++=0] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=588350919, x=100, x=152471338937, x=152897893533, X=2147483647, Y=1544423167, y=72, y++=0] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=588350919, x=7200, x=100, X=2147483647, x=154442316700, y=72, Y=1544423167, y++=0] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 150.7s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 920 mSDsluCounter, 1953 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2642 IncrementalHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 356 mSDtfsCounter, 2642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4779 GetRequests, 4003 SyntacticMatches, 90 SemanticMatches, 686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22720 ImplicationChecksByTransitivity, 77.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=9, InterpolantAutomatonStates: 599, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 45.2s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2992 ConstructedInterpolants, 0 QuantifiedInterpolants, 8188 SizeOfPredicates, 198 NumberOfNonLiveVariables, 4447 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 23482/92458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 13:07:46,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16b0606f-b9cf-46bb-b684-f25d2bd55e82/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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