./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 aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/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_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V --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 --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:46:59,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:46:59,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:46:59,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:46:59,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:46:59,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:46:59,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:46:59,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:46:59,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:46:59,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:46:59,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:46:59,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:46:59,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:46:59,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:46:59,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:46:59,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:46:59,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:46:59,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:46:59,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:46:59,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:46:59,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:46:59,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:46:59,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:46:59,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:46:59,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:46:59,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:46:59,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:46:59,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:46:59,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:46:59,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:46:59,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:46:59,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:46:59,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:46:59,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:46:59,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:46:59,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:46:59,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:46:59,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:46:59,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:46:59,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:46:59,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:46:59,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 02:46:59,289 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:46:59,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:46:59,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:46:59,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:46:59,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:46:59,297 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:46:59,298 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:46:59,298 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:46:59,298 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:46:59,298 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:46:59,299 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:46:59,300 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:46:59,300 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:46:59,300 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:46:59,300 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:46:59,301 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:46:59,301 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:46:59,301 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:46:59,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:46:59,302 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:46:59,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:46:59,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:46:59,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:46:59,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:46:59,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:46:59,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:46:59,305 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:46:59,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:46:59,306 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:46:59,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:46:59,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:46:59,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:46:59,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:46:59,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:46:59,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:46:59,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:46:59,316 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:46:59,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:46:59,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:46:59,316 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:46:59,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:46:59,317 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/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_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V 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 [2021-11-23 02:46:59,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:46:59,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:46:59,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:46:59,587 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:46:59,588 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:46:59,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-11-23 02:46:59,672 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/data/c25bb16bb/c4131f5a754b4f1ba2fe5c29105ce837/FLAGaaa38e4a9 [2021-11-23 02:47:00,094 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:47:00,095 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-11-23 02:47:00,101 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/data/c25bb16bb/c4131f5a754b4f1ba2fe5c29105ce837/FLAGaaa38e4a9 [2021-11-23 02:47:00,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/data/c25bb16bb/c4131f5a754b4f1ba2fe5c29105ce837 [2021-11-23 02:47:00,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:47:00,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:47:00,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:47:00,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:47:00,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:47:00,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360ef93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00, skipping insertion in model container [2021-11-23 02:47:00,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:47:00,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:47:00,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-11-23 02:47:00,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:47:00,736 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:47:00,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-11-23 02:47:00,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:47:00,769 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:47:00,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00 WrapperNode [2021-11-23 02:47:00,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:47:00,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:47:00,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:47:00,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:47:00,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,802 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-11-23 02:47:00,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:47:00,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:47:00,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:47:00,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:47:00,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:47:00,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:47:00,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:47:00,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:47:00,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (1/1) ... [2021-11-23 02:47:00,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:47:00,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:00,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:47:00,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:47:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:47:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:47:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:47:00,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:47:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-23 02:47:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-23 02:47:00,979 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:47:00,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:47:01,123 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:47:01,163 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:47:01,163 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 02:47:01,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:01 BoogieIcfgContainer [2021-11-23 02:47:01,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:47:01,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:47:01,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:47:01,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:47:01,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:47:00" (1/3) ... [2021-11-23 02:47:01,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a94061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:47:01, skipping insertion in model container [2021-11-23 02:47:01,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:00" (2/3) ... [2021-11-23 02:47:01,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a94061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:47:01, skipping insertion in model container [2021-11-23 02:47:01,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:01" (3/3) ... [2021-11-23 02:47:01,195 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2021-11-23 02:47:01,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:47:01,212 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 02:47:01,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:47:01,291 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:47:01,291 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 02:47:01,308 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) [2021-11-23 02:47:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 02:47:01,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:01,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:01,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2021-11-23 02:47:01,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:01,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490193410] [2021-11-23 02:47:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:01,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:01,417 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:01,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093642401] [2021-11-23 02:47:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:01,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:01,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:01,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:47:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:47:01,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 02:47:01,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:01,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:47:01,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:01,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490193410] [2021-11-23 02:47:01,663 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093642401] [2021-11-23 02:47:01,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093642401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:47:01,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:47:01,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:47:01,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987177149] [2021-11-23 02:47:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:47:01,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:47:01,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:47:01,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:47:01,727 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) [2021-11-23 02:47:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:01,924 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2021-11-23 02:47:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:47:01,932 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 [2021-11-23 02:47:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:01,939 INFO L225 Difference]: With dead ends: 42 [2021-11-23 02:47:01,939 INFO L226 Difference]: Without dead ends: 21 [2021-11-23 02:47:01,942 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:47:01,946 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:01,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:47:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-23 02:47:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-23 02:47:01,992 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) [2021-11-23 02:47:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-11-23 02:47:01,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2021-11-23 02:47:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:01,997 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-11-23 02:47:01,998 INFO L471 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) [2021-11-23 02:47:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2021-11-23 02:47:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:47:02,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:02,000 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:02,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:47:02,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-11-23 02:47:02,228 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2021-11-23 02:47:02,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486343779] [2021-11-23 02:47:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:02,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:02,246 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460203079] [2021-11-23 02:47:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:02,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:02,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:02,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:47:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:47:02,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 02:47:02,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:03,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:03,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:03,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486343779] [2021-11-23 02:47:03,474 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460203079] [2021-11-23 02:47:03,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460203079] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688001915] [2021-11-23 02:47:03,502 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-23 02:47:03,503 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:47:03,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:47:03,513 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:47:03,519 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:47:04,587 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 45 for LOIs [2021-11-23 02:47:04,726 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:47:05,116 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '225#(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 [2021-11-23 02:47:05,116 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:47:05,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:47:05,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-11-23 02:47:05,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346459091] [2021-11-23 02:47:05,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:47:05,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:47:05,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:47:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:47:05,120 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:47:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:05,633 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-23 02:47:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:47:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2021-11-23 02:47:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:05,635 INFO L225 Difference]: With dead ends: 35 [2021-11-23 02:47:05,635 INFO L226 Difference]: Without dead ends: 31 [2021-11-23 02:47:05,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-11-23 02:47:05,637 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:05,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:47:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-11-23 02:47:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2021-11-23 02:47:05,645 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) [2021-11-23 02:47:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-23 02:47:05,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2021-11-23 02:47:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:05,646 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-23 02:47:05,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:47:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-23 02:47:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 02:47:05,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:05,648 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:05,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-23 02:47:05,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:05,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:05,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2021-11-23 02:47:05,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:05,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143946785] [2021-11-23 02:47:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:05,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:05,883 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:05,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006582257] [2021-11-23 02:47:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:05,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:05,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:05,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:05,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:47:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:47:05,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:47:05,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:05,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:06,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143946785] [2021-11-23 02:47:06,074 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006582257] [2021-11-23 02:47:06,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006582257] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:06,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1615507425] [2021-11-23 02:47:06,077 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:47:06,077 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:47:06,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:47:06,078 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:47:06,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:47:06,928 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 91 for LOIs [2021-11-23 02:47:07,516 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:47:08,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '416#(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 [2021-11-23 02:47:08,412 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:47:08,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:47:08,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-11-23 02:47:08,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000260065] [2021-11-23 02:47:08,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:47:08,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:47:08,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:47:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:47:08,414 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) [2021-11-23 02:47:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:08,501 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2021-11-23 02:47:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:47:08,502 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 [2021-11-23 02:47:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:08,503 INFO L225 Difference]: With dead ends: 59 [2021-11-23 02:47:08,503 INFO L226 Difference]: Without dead ends: 53 [2021-11-23 02:47:08,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-23 02:47:08,507 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:08,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 74 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:47:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-23 02:47:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2021-11-23 02:47:08,516 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) [2021-11-23 02:47:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-11-23 02:47:08,517 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2021-11-23 02:47:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:08,518 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-11-23 02:47:08,518 INFO L471 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) [2021-11-23 02:47:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-11-23 02:47:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:47:08,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:08,519 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:08,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:47:08,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:08,736 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2021-11-23 02:47:08,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:08,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227326976] [2021-11-23 02:47:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:08,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:08,745 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:08,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187123998] [2021-11-23 02:47:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:08,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:08,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:08,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:47:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:47:08,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:47:08,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:47:09,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:47:09,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227326976] [2021-11-23 02:47:09,818 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:09,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187123998] [2021-11-23 02:47:09,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187123998] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:09,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1855391460] [2021-11-23 02:47:09,821 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:47:09,821 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:47:09,821 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:47:09,822 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:47:09,822 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:47:10,563 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 92 for LOIs [2021-11-23 02:47:10,883 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:47:13,639 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '712#(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 [2021-11-23 02:47:13,639 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:47:13,639 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:47:13,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2021-11-23 02:47:13,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795975991] [2021-11-23 02:47:13,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:47:13,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:47:13,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:13,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:47:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-11-23 02:47:13,642 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-23 02:47:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:14,114 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2021-11-23 02:47:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 02:47:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2021-11-23 02:47:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:14,115 INFO L225 Difference]: With dead ends: 49 [2021-11-23 02:47:14,116 INFO L226 Difference]: Without dead ends: 41 [2021-11-23 02:47:14,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2021-11-23 02:47:14,118 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:14,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 63 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:47:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-23 02:47:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-11-23 02:47:14,127 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) [2021-11-23 02:47:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2021-11-23 02:47:14,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2021-11-23 02:47:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:14,129 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2021-11-23 02:47:14,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-23 02:47:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2021-11-23 02:47:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 02:47:14,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:14,131 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:14,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:47:14,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:14,348 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2021-11-23 02:47:14,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:14,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939185912] [2021-11-23 02:47:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:14,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:14,357 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:14,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845893084] [2021-11-23 02:47:14,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:47:14,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:14,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:14,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:47:14,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-23 02:47:14,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:47:14,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-23 02:47:14,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:14,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 02:47:14,691 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939185912] [2021-11-23 02:47:14,691 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:14,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845893084] [2021-11-23 02:47:14,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845893084] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:14,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1163185142] [2021-11-23 02:47:14,694 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:47:14,695 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:47:14,695 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:47:14,695 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:47:14,695 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:47:15,336 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 91 for LOIs [2021-11-23 02:47:15,856 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:47:16,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1111#(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 [2021-11-23 02:47:16,816 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:47:16,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:47:16,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-11-23 02:47:16,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795867496] [2021-11-23 02:47:16,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:47:16,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 02:47:16,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 02:47:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:47:16,819 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) [2021-11-23 02:47:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:17,043 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-11-23 02:47:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 02:47:17,044 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 [2021-11-23 02:47:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:17,048 INFO L225 Difference]: With dead ends: 95 [2021-11-23 02:47:17,048 INFO L226 Difference]: Without dead ends: 89 [2021-11-23 02:47:17,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2021-11-23 02:47:17,050 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:17,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:47:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-23 02:47:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-23 02:47:17,070 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) [2021-11-23 02:47:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2021-11-23 02:47:17,072 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2021-11-23 02:47:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:17,072 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2021-11-23 02:47:17,073 INFO L471 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) [2021-11-23 02:47:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2021-11-23 02:47:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 02:47:17,076 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:17,076 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:17,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:47:17,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:17,284 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2021-11-23 02:47:17,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:17,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318262406] [2021-11-23 02:47:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:17,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:17,294 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268121230] [2021-11-23 02:47:17,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:47:17,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:17,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:17,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:17,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:47:17,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:47:17,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:47:17,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:47:17,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:17,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-23 02:47:18,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318262406] [2021-11-23 02:47:18,150 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268121230] [2021-11-23 02:47:18,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268121230] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168572544] [2021-11-23 02:47:18,152 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:47:18,152 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:47:18,152 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:47:18,152 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:47:18,153 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:47:18,753 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 91 for LOIs [2021-11-23 02:47:19,214 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:47:20,110 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1939#(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 [2021-11-23 02:47:20,110 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:47:20,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:47:20,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-11-23 02:47:20,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834078696] [2021-11-23 02:47:20,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:47:20,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-23 02:47:20,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:20,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-23 02:47:20,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2021-11-23 02:47:20,114 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) [2021-11-23 02:47:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:20,728 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2021-11-23 02:47:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-23 02:47:20,729 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 [2021-11-23 02:47:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:20,731 INFO L225 Difference]: With dead ends: 191 [2021-11-23 02:47:20,732 INFO L226 Difference]: Without dead ends: 185 [2021-11-23 02:47:20,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2021-11-23 02:47:20,735 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 182 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:20,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 152 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:47:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-23 02:47:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-11-23 02:47:20,767 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) [2021-11-23 02:47:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2021-11-23 02:47:20,770 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2021-11-23 02:47:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:20,771 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2021-11-23 02:47:20,772 INFO L471 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) [2021-11-23 02:47:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2021-11-23 02:47:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-23 02:47:20,782 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:20,782 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:20,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:47:20,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 02:47:20,987 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2021-11-23 02:47:20,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:20,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625131502] [2021-11-23 02:47:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:20,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:20,999 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:20,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85072050] [2021-11-23 02:47:20,999 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:47:20,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:21,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:21,020 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:21,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:47:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:47:21,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-23 02:47:21,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:47:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:47:21,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:47:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2021-11-23 02:47:22,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:47:22,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625131502] [2021-11-23 02:47:22,738 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:47:22,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85072050] [2021-11-23 02:47:22,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85072050] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:47:22,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810343813] [2021-11-23 02:47:22,740 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:47:22,740 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:47:22,741 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:47:22,741 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:47:22,741 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:47:23,393 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 91 for LOIs [2021-11-23 02:47:23,870 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:47:24,970 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3655#(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 [2021-11-23 02:47:24,970 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:47:24,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:47:24,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-11-23 02:47:24,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881468065] [2021-11-23 02:47:24,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:47:24,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-23 02:47:24,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:47:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-23 02:47:24,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=2375, Unknown=0, NotChecked=0, Total=3540 [2021-11-23 02:47:24,976 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) [2021-11-23 02:47:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:47:26,685 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2021-11-23 02:47:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-23 02:47:26,686 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 [2021-11-23 02:47:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:47:26,690 INFO L225 Difference]: With dead ends: 383 [2021-11-23 02:47:26,690 INFO L226 Difference]: Without dead ends: 377 [2021-11-23 02:47:26,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3348, Invalid=7572, Unknown=0, NotChecked=0, Total=10920 [2021-11-23 02:47:26,695 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 437 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:47:26,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 332 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:47:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-23 02:47:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-11-23 02:47:26,780 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) [2021-11-23 02:47:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2021-11-23 02:47:26,784 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2021-11-23 02:47:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:47:26,785 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2021-11-23 02:47:26,786 INFO L471 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) [2021-11-23 02:47:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2021-11-23 02:47:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-11-23 02:47:26,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:47:26,806 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2021-11-23 02:47:26,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-23 02:47:27,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:27,028 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:47:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:47:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2021-11-23 02:47:27,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:47:27,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351700004] [2021-11-23 02:47:27,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:47:27,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:47:27,046 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:47:27,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969811685] [2021-11-23 02:47:27,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:47:27,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:47:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:47:27,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:47:27,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:48:02,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2021-11-23 02:48:02,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:48:02,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-23 02:48:02,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:48:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:48:04,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:48:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2021-11-23 02:48:07,478 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:48:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351700004] [2021-11-23 02:48:07,479 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:48:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969811685] [2021-11-23 02:48:07,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969811685] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:48:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [305325276] [2021-11-23 02:48:07,481 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:48:07,481 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:48:07,482 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:48:07,482 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:48:07,482 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:48:08,034 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 91 for LOIs [2021-11-23 02:48:08,501 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:48:10,033 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7147#(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 [2021-11-23 02:48:10,033 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:48:10,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:48:10,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-11-23 02:48:10,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038442880] [2021-11-23 02:48:10,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:48:10,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-11-23 02:48:10,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:48:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-11-23 02:48:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4597, Invalid=6959, Unknown=0, NotChecked=0, Total=11556 [2021-11-23 02:48:10,040 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) [2021-11-23 02:48:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:48:15,231 INFO L93 Difference]: Finished difference Result 767 states and 814 transitions. [2021-11-23 02:48:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-23 02:48:15,233 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 [2021-11-23 02:48:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:48:15,243 INFO L225 Difference]: With dead ends: 767 [2021-11-23 02:48:15,243 INFO L226 Difference]: Without dead ends: 761 [2021-11-23 02:48:15,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13572, Invalid=26628, Unknown=0, NotChecked=0, Total=40200 [2021-11-23 02:48:15,257 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 1121 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:48:15,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 608 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-23 02:48:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-11-23 02:48:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2021-11-23 02:48:15,358 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) [2021-11-23 02:48:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 761 transitions. [2021-11-23 02:48:15,366 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 761 transitions. Word has length 376 [2021-11-23 02:48:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:48:15,369 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 761 transitions. [2021-11-23 02:48:15,370 INFO L471 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) [2021-11-23 02:48:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 761 transitions. [2021-11-23 02:48:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2021-11-23 02:48:15,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:48:15,393 INFO L514 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2021-11-23 02:48:15,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:48:15,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:48:15,612 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:48:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:48:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1094369733, now seen corresponding path program 6 times [2021-11-23 02:48:15,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:48:15,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966440105] [2021-11-23 02:48:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:48:15,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:48:15,642 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:48:15,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819956999] [2021-11-23 02:48:15,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:48:15,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:48:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:48:15,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:48:15,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:48:16,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:48:16,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:48:16,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 191 conjunts are in the unsatisfiable core [2021-11-23 02:48:16,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:48:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 188 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:48:21,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:48:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 188 proven. 17672 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2021-11-23 02:48:22,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:48:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966440105] [2021-11-23 02:48:22,909 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 02:48:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819956999] [2021-11-23 02:48:22,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819956999] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:48:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [89015852] [2021-11-23 02:48:22,911 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-23 02:48:22,912 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:48:22,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:48:22,912 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:48:22,912 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:48:23,459 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 91 for LOIs [2021-11-23 02:48:23,894 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:48:25,986 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14101#(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 [2021-11-23 02:48:25,987 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:48:25,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:48:25,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-11-23 02:48:25,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435705444] [2021-11-23 02:48:25,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 02:48:25,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-11-23 02:48:25,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:48:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-11-23 02:48:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5188, Invalid=7694, Unknown=0, NotChecked=0, Total=12882 [2021-11-23 02:48:25,994 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) [2021-11-23 02:48:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:48:31,080 INFO L93 Difference]: Finished difference Result 815 states and 820 transitions. [2021-11-23 02:48:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-11-23 02:48:31,082 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 [2021-11-23 02:48:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:48:31,089 INFO L225 Difference]: With dead ends: 815 [2021-11-23 02:48:31,089 INFO L226 Difference]: Without dead ends: 809 [2021-11-23 02:48:31,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2377 GetRequests, 2165 SyntacticMatches, 1 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6810 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15381, Invalid=29775, Unknown=0, NotChecked=0, Total=45156 [2021-11-23 02:48:31,095 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 878 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:48:31,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 560 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-23 02:48:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-11-23 02:48:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2021-11-23 02:48:31,180 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) [2021-11-23 02:48:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 809 transitions. [2021-11-23 02:48:31,185 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 809 transitions. Word has length 760 [2021-11-23 02:48:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:48:31,187 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 809 transitions. [2021-11-23 02:48:31,188 INFO L471 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) [2021-11-23 02:48:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 809 transitions. [2021-11-23 02:48:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2021-11-23 02:48:31,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:48:31,218 INFO L514 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2021-11-23 02:48:31,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:48:31,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-23 02:48:31,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:48:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:48:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1577450477, now seen corresponding path program 7 times [2021-11-23 02:48:31,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:48:31,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644558520] [2021-11-23 02:48:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:48:31,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:48:31,455 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 02:48:31,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47886222] [2021-11-23 02:48:31,456 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:48:31,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:48:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:48:31,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:48:31,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:48:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:48:40,493 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 02:48:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:48:52,368 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 02:48:52,368 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 02:48:52,369 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 02:48:52,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:48:52,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 02:48:52,588 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2021-11-23 02:48:52,594 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:48:52,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:48:52 BoogieIcfgContainer [2021-11-23 02:48:52,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:48:52,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:48:52,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:48:52,929 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:48:52,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:01" (3/4) ... [2021-11-23 02:48:52,933 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 02:48:53,289 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 02:48:53,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:48:53,290 INFO L158 Benchmark]: Toolchain (without parser) took 112804.17ms. Allocated memory was 96.5MB in the beginning and 371.2MB in the end (delta: 274.7MB). Free memory was 54.0MB in the beginning and 198.6MB in the end (delta: -144.6MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,291 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 96.5MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:48:53,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.50ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 71.1MB in the end (delta: -17.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.26ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 69.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,292 INFO L158 Benchmark]: Boogie Preprocessor took 19.07ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 68.6MB in the end (delta: 999.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,292 INFO L158 Benchmark]: RCFGBuilder took 343.44ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 58.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,293 INFO L158 Benchmark]: TraceAbstraction took 111760.45ms. Allocated memory was 96.5MB in the beginning and 371.2MB in the end (delta: 274.7MB). Free memory was 57.8MB in the beginning and 243.7MB in the end (delta: -185.8MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,294 INFO L158 Benchmark]: Witness Printer took 360.74ms. Allocated memory is still 371.2MB. Free memory was 243.7MB in the beginning and 198.6MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2021-11-23 02:48:53,296 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.25ms. Allocated memory is still 96.5MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.50ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 71.1MB in the end (delta: -17.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.26ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 69.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.07ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 68.6MB in the end (delta: 999.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.44ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 58.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 111760.45ms. Allocated memory was 96.5MB in the beginning and 371.2MB in the end (delta: 274.7MB). Free memory was 57.8MB in the beginning and 243.7MB in the end (delta: -185.8MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. * Witness Printer took 360.74ms. Allocated memory is still 371.2MB. Free memory was 243.7MB in the beginning and 198.6MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. 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=147, X=161, x=0, y=0, Y=154] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=147, x=0, X=161, y=0, Y=154] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=147, X=161, x=0, x=0, x=0, y=0, Y=154] [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=147, x=0, x=0, X=161, x=0, Y=154, 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=1, v=133, x=0, x=1, x=0, X=161, y=1, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=133, x=1, x=0, x=0, X=161, y=1, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=133, x=1, x=161, x=154, X=161, Y=154, y=1, y++=0] [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=133, x=1, X=161, x=154, x=161, Y=154, y=1, 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=2, v=119, x=2, X=161, x=161, x=154, y=2, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=119, X=161, x=2, x=161, x=154, y=2, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=119, x=2, x=308, X=161, x=322, y=2, Y=154, y++=0] [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=119, x=2, X=161, x=322, x=308, y=2, Y=154, 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=3, v=105, x=322, x=308, x=3, X=161, Y=154, y=3, y++=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=105, x=322, x=3, X=161, x=308, Y=154, y=3, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=105, x=462, x=483, X=161, x=3, Y=154, y=3, 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=105, x=462, x=3, x=483, X=161, Y=154, 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=4, v=91, x=4, X=161, x=462, x=483, Y=154, y=4, y++=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=91, X=161, x=462, x=483, x=4, Y=154, y=4, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=91, x=616, x=644, x=4, X=161, y=4, Y=154, 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=91, x=616, x=644, X=161, x=4, y=4, Y=154, 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=77, x=616, X=161, x=5, x=644, y=5, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=77, x=5, x=616, x=644, X=161, y=5, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=77, x=5, X=161, x=770, x=805, Y=154, y=5, y++=0] [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=77, x=805, x=770, X=161, x=5, Y=154, y=5, 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=6, v=63, X=161, x=805, x=6, x=770, Y=154, y=6, y++=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=63, x=805, x=770, X=161, x=6, y=6, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=63, x=924, x=6, x=966, X=161, Y=154, y=6, y++=0] [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=63, x=924, x=6, x=966, X=161, Y=154, y=6, 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=7, v=49, x=966, x=7, X=161, x=924, y=7, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=49, x=966, x=7, X=161, x=924, y=7, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=49, x=1078, x=7, X=161, x=1127, Y=154, y=7, 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=49, x=1127, x=7, X=161, x=1078, Y=154, y=7, 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=35, X=161, x=1127, x=1078, x=8, Y=154, y=8, y++=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=35, x=1078, x=1127, x=8, X=161, y=8, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=35, x=8, X=161, x=1232, x=1288, y=8, Y=154, y++=0] [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=35, x=8, x=1288, x=1232, X=161, Y=154, y=8, 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=9, v=21, x=1288, x=1232, X=161, x=9, Y=154, y=9, y++=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=21, x=9, x=1232, x=1288, X=161, Y=154, y=9, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=21, x=9, x=1449, X=161, x=1386, Y=154, y=9, y++=0] [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=21, x=1386, x=1449, X=161, x=9, Y=154, y=9, 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=10, v=7, x=1449, X=161, x=1386, x=10, Y=154, y=10, y++=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=7, x=1449, X=161, x=10, x=1386, Y=154, y=10, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=7, X=161, x=1540, x=10, x=1610, Y=154, y=10, 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=7, x=1540, x=1610, x=10, X=161, Y=154, 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=11, v=-7, x=1610, x=1540, x=11, X=161, Y=154, y=11, y++=268] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-7, x=1540, X=161, x=1610, x=11, y=11, Y=154, y++=268] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-7, x=1771, x=1694, X=161, x=11, y=11, Y=154, y++=268] [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=-7, x=1694, x=1771, X=161, x=11, y=11, Y=154, y++=268] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=12, v=301, x=1771, x=12, X=161, x=1694, y=11, Y=154, y++=268] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=301, X=161, x=12, x=1694, x=1771, y=11, Y=154, y++=268] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=301, x=12, X=161, x=1848, x=1771, Y=154, y=11, y++=268] [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=301, X=161, x=1771, x=12, x=1848, y=11, Y=154, 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=13, v=287, x=1771, X=161, x=13, x=1848, Y=154, y=12, y++=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=287, x=1771, x=1848, X=161, x=13, Y=154, y=12, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=287, x=2002, x=1932, x=13, X=161, Y=154, y=12, y++=0] [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=287, X=161, x=2002, x=1932, x=13, y=12, Y=154, 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=14, v=273, X=161, x=1932, x=2002, x=14, Y=154, y=13, y++=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=273, X=161, x=1932, x=2002, x=14, Y=154, y=13, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=273, x=14, x=2093, X=161, x=2156, y=13, Y=154, 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=273, x=2093, x=14, X=161, x=2156, Y=154, 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=15, v=259, x=2156, x=15, x=2093, X=161, Y=154, y=14, y++=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=259, x=2093, x=15, x=2156, X=161, Y=154, y=14, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=259, X=161, x=2310, x=2254, x=15, Y=154, y=14, 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=259, x=2310, x=2254, X=161, x=15, y=14, Y=154, 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=245, x=16, X=161, x=2310, x=2254, Y=154, y=15, y++=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=245, X=161, x=16, x=2254, x=2310, Y=154, y=15, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=245, x=2415, X=161, x=2464, x=16, Y=154, y=15, y++=0] [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=245, x=2415, x=2464, x=16, X=161, Y=154, 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=17, v=231, x=2415, x=17, x=2464, X=161, y=16, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=231, X=161, x=2464, x=2415, x=17, Y=154, y=16, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=231, x=2576, x=17, x=2618, X=161, y=16, Y=154, y++=0] [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=231, X=161, x=17, x=2576, x=2618, Y=154, 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=18, v=217, x=2618, x=18, x=2576, X=161, y=17, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=217, x=2618, x=18, X=161, x=2576, y=17, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=217, x=2772, x=2737, x=18, X=161, Y=154, y=17, 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=217, X=161, x=2737, x=18, x=2772, y=17, Y=154, 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=203, x=19, x=2772, X=161, x=2737, y=18, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=203, x=19, X=161, x=2737, x=2772, Y=154, y=18, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=203, x=19, X=161, x=2898, x=2926, Y=154, y=18, y++=0] [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=203, x=2926, X=161, x=19, x=2898, y=18, Y=154, 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=20, v=189, X=161, x=2926, x=20, x=2898, Y=154, y=19, y++=0] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=189, x=20, x=2898, X=161, x=2926, y=19, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=189, x=20, x=3059, x=3080, X=161, y=19, Y=154, y++=0] [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=189, x=20, x=3059, X=161, x=3080, y=19, Y=154, 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=21, v=175, x=3059, X=161, x=21, x=3080, Y=154, y=20, y++=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=175, X=161, x=3080, x=3059, x=21, Y=154, y=20, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=175, x=3234, X=161, x=21, x=3220, y=20, Y=154, 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=175, x=3220, x=3234, X=161, x=21, Y=154, y=20, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=22, v=161, x=3234, x=3220, x=22, X=161, Y=154, y=21, y++=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=161, X=161, x=3234, x=3220, x=22, Y=154, y=21, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=161, X=161, x=3388, x=22, x=3381, y=21, Y=154, 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=161, x=3381, X=161, x=22, x=3388, y=21, Y=154, 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=147, x=23, x=3388, x=3381, X=161, y=22, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=147, x=3381, x=3388, x=23, X=161, Y=154, y=22, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=147, x=3542, x=23, x=3542, X=161, Y=154, y=22, y++=0] [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=147, x=3542, x=3542, X=161, x=23, Y=154, y=22, 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=24, v=133, x=3542, x=24, x=3542, X=161, y=23, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=133, x=3542, x=24, x=3542, X=161, Y=154, y=23, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=133, X=161, x=3703, x=3696, x=24, Y=154, y=23, y++=0] [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=133, x=3703, x=3696, X=161, x=24, Y=154, 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=25, v=119, X=161, x=3703, x=3696, x=25, y=24, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=119, x=3696, x=25, X=161, x=3703, Y=154, y=24, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=119, X=161, x=3864, x=3850, x=25, Y=154, y=24, 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=119, x=3850, X=161, x=25, x=3864, y=24, Y=154, 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=105, x=3850, x=26, x=3864, X=161, y=25, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=105, X=161, x=3850, x=26, x=3864, Y=154, y=25, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=105, x=4004, x=4025, x=26, X=161, y=25, Y=154, y++=0] [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=105, x=26, x=4004, X=161, x=4025, y=25, Y=154, 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=27, v=91, X=161, x=4025, x=27, x=4004, Y=154, y=26, y++=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=91, x=27, x=4025, x=4004, X=161, y=26, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=91, x=4158, x=27, X=161, x=4186, Y=154, y=26, y++=0] [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=91, x=27, x=4186, X=161, x=4158, Y=154, y=26, 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=28, v=77, x=4186, X=161, x=4158, x=28, Y=154, y=27, y++=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=77, X=161, x=28, x=4186, x=4158, Y=154, y=27, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=77, x=28, x=4312, X=161, x=4347, Y=154, y=27, 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=77, x=4312, x=28, X=161, x=4347, y=27, Y=154, 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=63, X=161, x=4312, x=4347, x=29, Y=154, y=28, y++=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=63, x=4312, X=161, x=29, x=4347, y=28, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=63, X=161, x=4466, x=29, x=4508, Y=154, y=28, 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=63, x=29, x=4466, X=161, x=4508, y=28, Y=154, 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=49, x=4466, X=161, x=30, x=4508, y=29, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=49, x=4466, x=4508, x=30, X=161, y=29, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=49, X=161, x=30, x=4620, x=4669, y=29, Y=154, y++=0] [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=49, x=4620, x=4669, X=161, x=30, Y=154, y=29, 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=31, v=35, x=4669, x=4620, X=161, x=31, Y=154, y=30, y++=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=35, x=31, X=161, x=4620, x=4669, Y=154, y=30, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=35, X=161, x=4774, x=4830, x=31, Y=154, y=30, y++=0] [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=35, x=4774, X=161, x=4830, x=31, y=30, Y=154, 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=32, v=21, x=32, X=161, x=4830, x=4774, y=31, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=21, x=32, x=4774, x=4830, X=161, y=31, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=21, x=32, x=4991, x=4928, X=161, Y=154, y=31, 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=21, X=161, x=32, x=4928, x=4991, Y=154, 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=33, v=7, x=33, x=4928, X=161, x=4991, y=32, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=7, x=4928, x=4991, x=33, X=161, Y=154, y=32, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=7, X=161, x=33, x=5152, x=5082, y=32, Y=154, y++=0] [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=7, X=161, x=5152, x=33, x=5082, Y=154, y=32, 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=34, v=-7, x=34, X=161, x=5082, x=5152, Y=154, y=33, y++=460] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-7, x=5082, x=34, X=161, x=5152, y=33, Y=154, y++=460] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-7, x=34, x=5236, x=5313, X=161, Y=154, y=33, y++=460] [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=-7, x=34, X=161, x=5236, x=5313, y=33, Y=154, y++=460] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=35, v=301, x=5236, X=161, x=5313, x=35, Y=154, y=33, y++=460] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=301, x=35, x=5313, x=5236, X=161, Y=154, y=33, y++=460] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=301, x=5390, x=35, X=161, x=5313, Y=154, y=33, y++=460] [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=301, x=35, x=5390, x=5313, X=161, Y=154, y=33, y++=460] [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=287, x=5313, x=5390, x=36, X=161, y=34, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=287, x=5313, x=5390, X=161, x=36, Y=154, y=34, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=287, x=5544, x=36, X=161, x=5474, Y=154, y=34, 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=287, x=5474, x=36, x=5544, X=161, Y=154, y=34, 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=273, x=5544, X=161, x=5474, x=37, Y=154, y=35, y++=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=273, X=161, x=5544, x=37, x=5474, y=35, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=273, x=37, x=5698, X=161, x=5635, Y=154, y=35, y++=0] [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=273, X=161, x=5635, x=37, x=5698, y=35, Y=154, 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=38, v=259, x=5698, x=5635, x=38, X=161, Y=154, y=36, y++=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=259, x=38, x=5635, X=161, x=5698, Y=154, y=36, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=259, X=161, x=5796, x=38, x=5852, Y=154, y=36, y++=0] [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=259, x=38, x=5852, x=5796, X=161, y=36, Y=154, 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=39, v=245, x=5796, x=5852, X=161, x=39, Y=154, y=37, y++=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=245, x=5852, x=5796, X=161, x=39, y=37, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=245, x=5957, x=39, X=161, x=6006, Y=154, y=37, 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=245, x=5957, x=6006, x=39, X=161, y=37, Y=154, 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=231, x=40, x=6006, x=5957, X=161, Y=154, y=38, y++=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=231, X=161, x=40, x=5957, x=6006, Y=154, y=38, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=231, x=40, x=6118, X=161, x=6160, y=38, Y=154, y++=0] [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=231, x=6118, x=40, x=6160, X=161, y=38, Y=154, 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=41, v=217, x=6118, X=161, x=41, x=6160, Y=154, y=39, y++=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=217, x=41, X=161, x=6118, x=6160, y=39, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=217, x=41, x=6279, x=6314, X=161, Y=154, y=39, y++=0] [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=217, x=6314, x=41, x=6279, X=161, Y=154, 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=42, v=203, x=6314, X=161, x=42, x=6279, Y=154, y=40, y++=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=203, X=161, x=6279, x=42, x=6314, Y=154, y=40, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=203, X=161, x=42, x=6440, x=6468, Y=154, y=40, 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=203, x=6468, X=161, x=6440, x=42, Y=154, y=40, 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=189, x=6440, x=43, x=6468, X=161, Y=154, y=41, y++=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=189, X=161, x=6468, x=6440, x=43, Y=154, y=41, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=189, x=43, x=6622, X=161, x=6601, y=41, Y=154, 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=189, x=6622, x=6601, X=161, x=43, y=41, Y=154, 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=175, x=44, X=161, x=6601, x=6622, Y=154, y=42, y++=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=175, x=6601, x=44, X=161, x=6622, y=42, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=175, x=6762, x=44, X=161, x=6776, Y=154, y=42, y++=0] [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=175, x=6776, x=6762, x=44, X=161, y=42, Y=154, 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=45, v=161, x=6776, X=161, x=45, x=6762, Y=154, y=43, y++=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=161, x=6776, X=161, x=45, x=6762, y=43, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=161, x=6930, x=6923, x=45, X=161, y=43, Y=154, y++=0] [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=161, X=161, x=6930, x=45, x=6923, y=43, Y=154, 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=46, v=147, x=6923, x=6930, x=46, X=161, y=44, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=147, x=46, x=6923, X=161, x=6930, y=44, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=147, x=46, x=7084, X=161, x=7084, y=44, Y=154, 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=147, x=7084, X=161, x=46, x=7084, y=44, Y=154, 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=133, X=161, x=7084, x=7084, x=47, Y=154, y=45, y++=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=133, x=47, x=7084, x=7084, X=161, y=45, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=133, X=161, x=7245, x=47, x=7238, y=45, Y=154, 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=133, x=47, X=161, x=7245, x=7238, Y=154, y=45, 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=119, x=7238, x=7245, X=161, x=48, Y=154, y=46, y++=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=119, X=161, x=7238, x=7245, x=48, Y=154, y=46, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=119, X=161, x=48, x=7392, x=7406, y=46, Y=154, y++=0] [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=119, x=7406, X=161, x=48, x=7392, Y=154, y=46, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=49, v=105, x=7406, x=49, X=161, x=7392, y=47, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=105, x=7406, x=7392, X=161, x=49, Y=154, y=47, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=105, x=7567, X=161, x=49, x=7546, y=47, Y=154, y++=0] [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=105, x=7567, X=161, x=7546, x=49, y=47, Y=154, 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=50, v=91, x=7567, x=50, X=161, x=7546, Y=154, y=48, y++=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=91, x=50, X=161, x=7546, x=7567, y=48, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=91, x=50, X=161, x=7728, x=7700, y=48, Y=154, 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=91, x=7700, x=50, x=7728, X=161, y=48, Y=154, 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=77, x=7728, x=51, x=7700, X=161, Y=154, y=49, y++=0] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=77, x=7728, x=51, X=161, x=7700, Y=154, y=49, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=77, x=51, X=161, x=7889, x=7854, Y=154, y=49, y++=0] [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=77, x=51, X=161, x=7854, x=7889, Y=154, 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=52, v=63, x=7889, X=161, x=7854, x=52, y=50, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=63, X=161, x=52, x=7854, x=7889, y=50, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=63, x=8008, x=52, x=8050, X=161, y=50, Y=154, y++=0] [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=63, x=8008, x=52, x=8050, X=161, y=50, Y=154, 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=53, v=49, X=161, x=8050, x=53, x=8008, y=51, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=49, x=8050, X=161, x=8008, x=53, y=51, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=49, x=8211, X=161, x=53, x=8162, Y=154, y=51, 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=49, x=8162, x=8211, X=161, x=53, Y=154, y=51, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=54, v=35, x=54, x=8162, x=8211, X=161, Y=154, y=52, y++=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=35, x=54, x=8211, x=8162, X=161, y=52, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=35, x=54, x=8372, X=161, x=8316, y=52, Y=154, 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=35, x=8316, X=161, x=54, x=8372, y=52, Y=154, 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=21, X=161, x=8372, x=55, x=8316, Y=154, y=53, y++=0] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=21, X=161, x=8316, x=55, x=8372, y=53, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=21, x=8470, x=55, x=8533, X=161, Y=154, y=53, y++=0] [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=21, X=161, x=8533, x=8470, x=55, Y=154, 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=56, v=7, x=8533, x=56, X=161, x=8470, Y=154, y=54, y++=0] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=7, x=56, x=8533, x=8470, X=161, y=54, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=7, x=8624, x=56, X=161, x=8694, y=54, Y=154, y++=0] [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=7, x=8694, x=56, x=8624, X=161, y=54, Y=154, 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=57, v=-7, x=8624, x=57, X=161, x=8694, Y=154, y=55, y++=648] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-7, x=8624, x=57, X=161, x=8694, Y=154, y=55, y++=648] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-7, X=161, x=8778, x=8855, x=57, Y=154, y=55, y++=648] [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=-7, x=8778, X=161, x=8855, x=57, Y=154, y=55, y++=648] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=58, v=301, X=161, x=8855, x=8778, x=58, Y=154, y=55, y++=648] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=301, x=8855, x=58, X=161, x=8778, Y=154, y=55, y++=648] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=301, x=8855, x=8932, X=161, x=58, Y=154, y=55, y++=648] [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=301, x=8855, X=161, x=58, x=8932, Y=154, y=55, y++=648] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=59, v=287, x=8855, X=161, x=59, x=8932, y=56, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=287, x=59, x=8855, X=161, x=8932, y=56, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=287, X=161, x=9086, x=59, x=9016, y=56, Y=154, y++=0] [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=287, X=161, x=9086, x=59, x=9016, y=56, Y=154, 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=60, v=273, x=9086, x=9016, x=60, X=161, Y=154, y=57, y++=0] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=273, x=9016, X=161, x=60, x=9086, Y=154, y=57, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=273, x=9177, x=60, X=161, x=9240, y=57, Y=154, 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=273, x=9240, x=9177, X=161, x=60, y=57, Y=154, 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=259, x=61, x=9240, x=9177, X=161, y=58, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=259, x=9177, X=161, x=9240, x=61, y=58, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=259, x=9394, x=9338, x=61, X=161, Y=154, y=58, 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=259, x=9394, x=61, X=161, x=9338, y=58, Y=154, 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=245, X=161, x=9394, x=62, x=9338, y=59, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=245, x=9394, x=9338, X=161, x=62, Y=154, y=59, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=245, x=9548, x=62, x=9499, X=161, Y=154, y=59, y++=0] [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=245, X=161, x=9548, x=9499, x=62, y=59, Y=154, 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=63, v=231, X=161, x=9548, x=9499, x=63, y=60, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=231, x=9548, x=9499, x=63, X=161, y=60, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=231, x=9702, x=63, x=9660, X=161, Y=154, y=60, y++=0] [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=231, x=9660, x=9702, x=63, X=161, Y=154, y=60, 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=64, v=217, x=64, x=9660, x=9702, X=161, y=61, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=217, x=64, X=161, x=9702, x=9660, Y=154, y=61, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=217, x=9821, x=9856, X=161, x=64, y=61, Y=154, 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=217, x=9821, x=64, x=9856, X=161, y=61, Y=154, 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=203, x=65, x=9821, X=161, x=9856, y=62, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=203, x=9821, x=9856, x=65, X=161, Y=154, y=62, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=203, x=65, x=9982, X=161, x=10010, Y=154, y=62, y++=0] [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=203, X=161, x=9982, x=10010, x=65, y=62, Y=154, 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=66, v=189, x=66, X=161, x=10010, x=9982, y=63, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=189, x=10010, X=161, x=66, x=9982, y=63, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=189, x=66, x=10143, x=10164, X=161, y=63, Y=154, y++=0] [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=189, x=10164, x=66, X=161, x=10143, y=63, Y=154, 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=67, v=175, X=161, x=10164, x=67, x=10143, Y=154, y=64, y++=0] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=175, x=10143, x=10164, X=161, x=67, Y=154, y=64, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=175, x=67, x=10318, x=10304, X=161, Y=154, y=64, 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=175, x=10318, X=161, x=67, x=10304, y=64, Y=154, 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=161, X=161, x=68, x=10304, x=10318, Y=154, y=65, y++=0] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=161, x=10304, x=68, x=10318, X=161, Y=154, y=65, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=161, x=68, x=10472, x=10465, X=161, Y=154, y=65, 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=161, x=68, x=10465, X=161, x=10472, y=65, Y=154, 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=147, X=161, x=10465, x=69, x=10472, y=66, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=147, x=10472, x=10465, X=161, x=69, Y=154, y=66, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=147, X=161, x=69, x=10626, x=10626, Y=154, y=66, y++=0] [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=147, x=69, x=10626, X=161, x=10626, Y=154, 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=70, v=133, x=70, x=10626, X=161, x=10626, y=67, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=133, X=161, x=10626, x=10626, x=70, Y=154, y=67, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=133, X=161, x=70, x=10787, x=10780, Y=154, y=67, y++=0] [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=133, x=10780, X=161, x=10787, x=70, Y=154, 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=71, v=119, x=10780, X=161, x=10787, x=71, Y=154, y=68, y++=0] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=119, x=10780, X=161, x=10787, x=71, Y=154, y=68, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=119, x=71, x=10948, x=10934, X=161, y=68, Y=154, 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=119, x=10934, X=161, x=71, x=10948, y=68, Y=154, 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=105, x=72, x=10934, x=10948, X=161, Y=154, y=69, y++=0] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=105, x=10934, X=161, x=72, x=10948, Y=154, y=69, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=105, x=11088, x=11109, X=161, x=72, y=69, Y=154, y++=0] [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=105, x=11088, x=72, x=11109, X=161, y=69, Y=154, 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=73, v=91, x=11109, X=161, x=73, x=11088, y=70, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=91, x=73, x=11088, X=161, x=11109, y=70, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=91, X=161, x=11270, x=11242, x=73, y=70, Y=154, y++=0] [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=91, X=161, x=73, x=11242, x=11270, Y=154, y=70, 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=74, v=77, x=11270, X=161, x=74, x=11242, y=71, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=77, x=11270, x=11242, X=161, x=74, y=71, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=77, x=11431, X=161, x=11396, x=74, Y=154, y=71, 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=77, x=74, x=11396, x=11431, X=161, y=71, Y=154, 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=63, X=161, x=75, x=11396, x=11431, y=72, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=63, X=161, x=11396, x=11431, x=75, Y=154, y=72, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=63, X=161, x=11550, x=75, x=11592, y=72, Y=154, 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=63, x=75, x=11550, X=161, x=11592, y=72, Y=154, 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=49, X=161, x=11550, x=76, x=11592, y=73, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=49, X=161, x=11550, x=11592, x=76, Y=154, y=73, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=49, x=76, X=161, x=11753, x=11704, y=73, Y=154, y++=0] [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=49, x=11753, x=76, X=161, x=11704, Y=154, y=73, 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=77, v=35, x=11704, x=11753, X=161, x=77, Y=154, y=74, y++=0] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=35, X=161, x=11753, x=77, x=11704, y=74, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=35, X=161, x=11858, x=11914, x=77, y=74, Y=154, y++=0] [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=35, x=77, x=11914, X=161, x=11858, y=74, Y=154, 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=78, v=21, x=11858, x=11914, X=161, x=78, Y=154, y=75, y++=0] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=21, x=78, x=11914, X=161, x=11858, Y=154, y=75, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=21, x=12075, x=78, x=12012, X=161, y=75, Y=154, 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=21, x=12075, x=12012, x=78, X=161, Y=154, y=75, 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=7, x=12075, X=161, x=79, x=12012, Y=154, y=76, y++=0] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=7, x=79, x=12012, X=161, x=12075, Y=154, y=76, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=7, X=161, x=12166, x=79, x=12236, y=76, Y=154, 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=7, x=12236, X=161, x=12166, x=79, Y=154, y=76, 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=-7, x=80, X=161, x=12236, x=12166, Y=154, y=77, y++=836] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-7, X=161, x=80, x=12166, x=12236, y=77, Y=154, y++=836] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-7, x=12320, x=80, x=12397, X=161, y=77, Y=154, y++=836] [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=-7, x=12397, x=80, X=161, x=12320, Y=154, y=77, y++=836] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=81, v=301, x=12320, x=81, x=12397, X=161, y=77, Y=154, y++=836] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=301, x=12320, x=12397, x=81, X=161, y=77, Y=154, y++=836] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=301, X=161, x=12474, x=81, x=12397, y=77, Y=154, y++=836] [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=301, x=12474, X=161, x=12397, x=81, y=77, Y=154, y++=836] [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=287, x=82, x=12474, x=12397, X=161, Y=154, y=78, y++=0] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=287, x=82, x=12397, x=12474, X=161, y=78, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=287, X=161, x=82, x=12628, x=12558, y=78, Y=154, 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=287, x=12628, x=82, X=161, x=12558, y=78, Y=154, 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=273, X=161, x=83, x=12558, x=12628, Y=154, y=79, y++=0] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=273, x=12628, X=161, x=12558, x=83, y=79, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=273, x=83, x=12782, x=12719, X=161, y=79, Y=154, y++=0] [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=273, x=83, x=12719, x=12782, X=161, Y=154, y=79, 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=84, v=259, X=161, x=84, x=12719, x=12782, Y=154, y=80, y++=0] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=259, x=12782, x=84, x=12719, X=161, Y=154, y=80, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=259, x=12880, X=161, x=12936, x=84, y=80, Y=154, y++=0] [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=259, X=161, x=12936, x=12880, x=84, y=80, Y=154, 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=85, v=245, x=12880, x=12936, X=161, x=85, Y=154, y=81, y++=0] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=245, x=12880, x=12936, X=161, x=85, y=81, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=245, x=13090, X=161, x=13041, x=85, y=81, Y=154, 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=245, X=161, x=13041, x=85, x=13090, y=81, Y=154, 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=231, x=13090, x=13041, X=161, x=86, y=82, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=231, x=13090, x=86, x=13041, X=161, y=82, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=231, x=13244, x=86, X=161, x=13202, y=82, Y=154, 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=231, x=86, x=13202, X=161, x=13244, Y=154, y=82, 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=217, X=161, x=13202, x=87, x=13244, Y=154, y=83, y++=0] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=217, x=87, x=13244, X=161, x=13202, y=83, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=217, x=13398, x=87, x=13363, X=161, y=83, Y=154, y++=0] [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=217, x=13363, X=161, x=13398, x=87, Y=154, y=83, 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=88, v=203, x=88, x=13363, X=161, x=13398, y=84, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=203, x=13398, X=161, x=13363, x=88, Y=154, y=84, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=203, X=161, x=88, x=13552, x=13524, Y=154, y=84, y++=0] [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=203, x=13552, X=161, x=88, x=13524, y=84, Y=154, 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=89, v=189, x=13524, x=13552, x=89, X=161, y=85, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=189, x=13552, x=89, x=13524, X=161, Y=154, y=85, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=189, x=13685, X=161, x=13706, x=89, y=85, Y=154, 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=189, x=13685, X=161, x=89, x=13706, Y=154, y=85, 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=175, x=13685, x=13706, x=90, X=161, y=86, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=175, x=90, X=161, x=13706, x=13685, Y=154, y=86, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=175, X=161, x=13846, x=90, x=13860, Y=154, y=86, y++=0] [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=175, x=13846, X=161, x=13860, x=90, Y=154, y=86, 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=91, v=161, X=161, x=13846, x=13860, x=91, y=87, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=161, x=13846, X=161, x=91, x=13860, Y=154, y=87, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=161, X=161, x=14014, x=91, x=14007, Y=154, y=87, y++=0] [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=161, x=14007, x=14014, x=91, X=161, Y=154, y=87, 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=92, v=147, x=14014, x=14007, X=161, x=92, Y=154, y=88, y++=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=147, X=161, x=14014, x=14007, x=92, Y=154, y=88, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=147, x=92, x=14168, X=161, x=14168, y=88, Y=154, 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=147, x=92, x=14168, x=14168, X=161, y=88, Y=154, 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=133, x=14168, X=161, x=14168, x=93, Y=154, y=89, y++=0] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=133, X=161, x=14168, x=93, x=14168, Y=154, y=89, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=133, x=93, x=14322, X=161, x=14329, Y=154, y=89, 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=133, X=161, x=14322, x=93, x=14329, Y=154, y=89, 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=119, X=161, x=14329, x=14322, x=94, Y=154, y=90, y++=0] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=119, x=94, x=14329, x=14322, X=161, Y=154, y=90, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=119, x=14490, x=94, x=14476, X=161, y=90, Y=154, y++=0] [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=119, X=161, x=14476, x=14490, x=94, y=90, Y=154, 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=95, v=105, x=14490, X=161, x=95, x=14476, y=91, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=105, x=14476, x=95, x=14490, X=161, Y=154, y=91, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=105, x=14651, x=14630, x=95, X=161, Y=154, y=91, y++=0] [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=105, X=161, x=14630, x=14651, x=95, y=91, Y=154, 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=96, v=91, X=161, x=96, x=14630, x=14651, Y=154, y=92, y++=0] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=91, x=96, x=14630, x=14651, X=161, Y=154, y=92, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=91, x=96, X=161, x=14784, x=14812, Y=154, y=92, 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=91, x=96, x=14812, X=161, x=14784, Y=154, y=92, 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=77, X=161, x=14784, x=97, x=14812, Y=154, y=93, y++=0] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=77, x=14784, X=161, x=14812, x=97, y=93, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=77, x=14938, x=14973, X=161, x=97, Y=154, y=93, y++=0] [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=77, x=14938, x=97, X=161, x=14973, Y=154, y=93, 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=98, v=63, x=98, x=14973, x=14938, X=161, Y=154, y=94, y++=0] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=63, x=14973, X=161, x=98, x=14938, Y=154, y=94, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=63, X=161, x=98, x=15134, x=15092, Y=154, y=94, y++=0] [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=63, x=15092, X=161, x=98, x=15134, y=94, Y=154, 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=99, v=49, x=15092, x=15134, X=161, x=99, Y=154, y=95, y++=0] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=49, x=99, x=15134, X=161, x=15092, y=95, Y=154, y++=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=49, x=15295, x=99, x=15246, X=161, y=95, Y=154, 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=49, x=99, X=161, x=15295, x=15246, y=95, Y=154, 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=35, x=15295, x=15246, X=161, x=100, y=96, Y=154, y++=0] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=35, x=15295, x=100, X=161, x=15246, Y=154, y=96, y++=0] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=35, x=9600, x=15400, X=161, x=100, y=96, Y=154, 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: 111.3s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2761 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2761 mSDsluCounter, 1979 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1918 mSDsCounter, 1069 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2512 IncrementalHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1069 mSolverCounterUnsat, 357 mSDtfsCounter, 2512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4778 GetRequests, 4096 SyntacticMatches, 3 SemanticMatches, 679 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18183 ImplicationChecksByTransitivity, 28.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=9, InterpolantAutomatonStates: 597, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 46.0s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2992 ConstructedInterpolants, 0 QuantifiedInterpolants, 8153 SizeOfPredicates, 193 NumberOfNonLiveVariables, 4447 ConjunctsInSsa, 427 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 23484/92458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-23 02:48:53,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b8778c-5df7-4c1d-9848-8c4c01c622b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE