./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:50:10,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:50:10,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:50:10,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:50:10,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:50:10,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:50:10,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:50:10,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:50:10,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:50:10,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:50:10,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:50:10,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:50:10,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:50:10,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:50:10,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:50:10,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:50:10,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:50:10,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:50:10,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:50:10,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:50:10,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:50:10,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:50:10,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:50:10,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:50:10,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:50:10,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:50:10,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:50:10,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:50:10,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:50:10,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:50:10,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:50:10,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:50:10,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:50:10,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:50:10,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:50:10,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:50:10,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:50:10,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:50:10,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:50:10,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:50:10,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:50:10,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:50:10,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:50:10,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:50:10,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:50:10,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:50:10,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:50:10,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:50:10,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:50:10,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:50:10,212 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:50:10,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:50:10,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:50:10,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:50:10,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:50:10,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:50:10,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:50:10,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:50:10,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:50:10,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:50:10,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:50:10,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:50:10,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:50:10,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:50:10,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:50:10,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:50:10,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:10,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:50:10,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:50:10,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:50:10,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:50:10,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:50:10,219 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:50:10,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:50:10,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:50:10,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/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_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2022-11-16 12:50:10,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:50:10,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:50:10,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:50:10,603 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:50:10,604 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:50:10,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-11-16 12:50:10,684 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/data/8ba651b92/fe82f9fc30aa4a5387c7c3184700fa72/FLAG5c0b2091f [2022-11-16 12:50:11,260 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:50:11,260 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-11-16 12:50:11,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/data/8ba651b92/fe82f9fc30aa4a5387c7c3184700fa72/FLAG5c0b2091f [2022-11-16 12:50:11,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/data/8ba651b92/fe82f9fc30aa4a5387c7c3184700fa72 [2022-11-16 12:50:11,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:50:11,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:50:11,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:11,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:50:11,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:50:11,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24adf547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11, skipping insertion in model container [2022-11-16 12:50:11,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:50:11,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:50:11,883 WARN L229 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_757014aa-628d-44fa-85d7-69d9c56c9383/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-11-16 12:50:11,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:11,907 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:50:11,920 WARN L229 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_757014aa-628d-44fa-85d7-69d9c56c9383/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-11-16 12:50:11,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:11,940 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:50:11,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11 WrapperNode [2022-11-16 12:50:11,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:11,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:11,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:50:11,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:50:11,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,973 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-16 12:50:11,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:11,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:50:11,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:50:11,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:50:11,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:11,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:50:11,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:50:11,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:50:11,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:50:12,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (1/1) ... [2022-11-16 12:50:12,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:12,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:12,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:50:12,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:50:12,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:50:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:50:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:50:12,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:50:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:50:12,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:50:12,164 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:50:12,166 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:50:12,354 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:50:12,360 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:50:12,360 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:50:12,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:12 BoogieIcfgContainer [2022-11-16 12:50:12,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:50:12,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:50:12,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:50:12,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:50:12,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:50:11" (1/3) ... [2022-11-16 12:50:12,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35509bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:12, skipping insertion in model container [2022-11-16 12:50:12,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:11" (2/3) ... [2022-11-16 12:50:12,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35509bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:12, skipping insertion in model container [2022-11-16 12:50:12,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:12" (3/3) ... [2022-11-16 12:50:12,371 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2022-11-16 12:50:12,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:50:12,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:50:12,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:50:12,470 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33261fdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:50:12,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:50:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:50:12,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:12,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:12,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-11-16 12:50:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:12,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489344090] [2022-11-16 12:50:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:12,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:12,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792625687] [2022-11-16 12:50:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:12,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:12,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:12,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:50:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:12,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:50:12,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:12,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:50:12,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489344090] [2022-11-16 12:50:12,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792625687] [2022-11-16 12:50:12,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792625687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:12,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:12,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:50:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356852255] [2022-11-16 12:50:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:12,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:50:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:50:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:50:13,007 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:50:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:13,186 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-11-16 12:50:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:50:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 8 [2022-11-16 12:50:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:13,197 INFO L225 Difference]: With dead ends: 54 [2022-11-16 12:50:13,197 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 12:50:13,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:13,203 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:13,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 12:50:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-16 12:50:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-16 12:50:13,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-11-16 12:50:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:13,263 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-16 12:50:13,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:50:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-16 12:50:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:50:13,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:13,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:13,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:50:13,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 12:50:13,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-11-16 12:50:13,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:13,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566015273] [2022-11-16 12:50:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:13,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:13,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567321289] [2022-11-16 12:50:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:13,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:13,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:13,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:13,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:50:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:13,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:50:13,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:13,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:14,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566015273] [2022-11-16 12:50:14,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567321289] [2022-11-16 12:50:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567321289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:14,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:14,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-11-16 12:50:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353469394] [2022-11-16 12:50:14,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:14,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:50:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:50:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:50:14,626 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:15,240 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-11-16 12:50:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:50:15,241 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-16 12:50:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:15,242 INFO L225 Difference]: With dead ends: 41 [2022-11-16 12:50:15,242 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 12:50:15,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:50:15,244 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:15,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 64 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:50:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 12:50:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-16 12:50:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:50:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-16 12:50:15,266 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-11-16 12:50:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:15,266 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-16 12:50:15,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-16 12:50:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:50:15,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:15,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:15,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:15,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:15,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-11-16 12:50:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:15,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358963901] [2022-11-16 12:50:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:15,488 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088101844] [2022-11-16 12:50:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:15,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:15,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:15,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:15,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:50:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:15,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:50:15,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:15,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:15,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358963901] [2022-11-16 12:50:15,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088101844] [2022-11-16 12:50:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088101844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:15,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-16 12:50:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411277899] [2022-11-16 12:50:15,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:50:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:50:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:50:15,687 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:15,785 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-16 12:50:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:50:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 19 [2022-11-16 12:50:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:15,790 INFO L225 Difference]: With dead ends: 73 [2022-11-16 12:50:15,790 INFO L226 Difference]: Without dead ends: 67 [2022-11-16 12:50:15,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:50:15,794 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:15,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:50:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-16 12:50:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-16 12:50:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:50:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-11-16 12:50:15,814 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-11-16 12:50:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:15,814 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-11-16 12:50:15,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:50:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-11-16 12:50:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:50:15,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:15,816 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:15,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:16,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:16,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-11-16 12:50:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:16,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116267401] [2022-11-16 12:50:16,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:16,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:16,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:16,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524247048] [2022-11-16 12:50:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:16,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:16,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:16,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:50:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:16,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:50:16,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:50:16,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:50:17,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:17,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116267401] [2022-11-16 12:50:17,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:17,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524247048] [2022-11-16 12:50:17,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524247048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:17,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:17,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2022-11-16 12:50:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487368997] [2022-11-16 12:50:17,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:17,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:50:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:50:17,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:50:17,028 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 12:50:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:18,082 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-16 12:50:18,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 12:50:18,084 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2022-11-16 12:50:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:18,085 INFO L225 Difference]: With dead ends: 65 [2022-11-16 12:50:18,085 INFO L226 Difference]: Without dead ends: 57 [2022-11-16 12:50:18,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 12:50:18,087 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:18,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 78 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:50:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-16 12:50:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-11-16 12:50:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 12:50:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-11-16 12:50:18,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2022-11-16 12:50:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:18,123 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-11-16 12:50:18,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 12:50:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-11-16 12:50:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:50:18,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:18,126 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:18,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:50:18,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:18,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-11-16 12:50:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:18,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763367587] [2022-11-16 12:50:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:18,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:18,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549618369] [2022-11-16 12:50:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:18,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:18,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:18,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:50:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:18,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:50:18,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:18,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:50:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763367587] [2022-11-16 12:50:18,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549618369] [2022-11-16 12:50:18,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549618369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:18,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-16 12:50:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437772677] [2022-11-16 12:50:18,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:18,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:50:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:50:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:50:18,643 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 12:50:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:18,862 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-11-16 12:50:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:50:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 49 [2022-11-16 12:50:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:18,865 INFO L225 Difference]: With dead ends: 116 [2022-11-16 12:50:18,865 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 12:50:18,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:50:18,867 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:18,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 166 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:50:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 12:50:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-16 12:50:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 12:50:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-11-16 12:50:18,898 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-11-16 12:50:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:18,899 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-11-16 12:50:18,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 12:50:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-11-16 12:50:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-16 12:50:18,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:18,902 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:18,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 12:50:19,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:19,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-11-16 12:50:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:19,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59988810] [2022-11-16 12:50:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:19,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438947031] [2022-11-16 12:50:19,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:50:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:19,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:19,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:50:19,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:50:19,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:50:19,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:50:19,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:19,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 12:50:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59988810] [2022-11-16 12:50:19,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438947031] [2022-11-16 12:50:19,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438947031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:19,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:19,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-16 12:50:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7836492] [2022-11-16 12:50:19,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:19,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:50:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:50:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:50:19,887 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-16 12:50:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:20,484 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-11-16 12:50:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 12:50:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 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 109 [2022-11-16 12:50:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:20,491 INFO L225 Difference]: With dead ends: 236 [2022-11-16 12:50:20,492 INFO L226 Difference]: Without dead ends: 230 [2022-11-16 12:50:20,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-16 12:50:20,495 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 229 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:20,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 286 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:50:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-16 12:50:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-16 12:50:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 12:50:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-11-16 12:50:20,574 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-11-16 12:50:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:20,577 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-11-16 12:50:20,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-16 12:50:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-11-16 12:50:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-16 12:50:20,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:20,593 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:20,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:50:20,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-11-16 12:50:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:20,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68291693] [2022-11-16 12:50:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:20,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:20,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880130104] [2022-11-16 12:50:20,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:50:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:20,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:20,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:20,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:50:20,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:50:20,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:50:20,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:50:20,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-11-16 12:50:21,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-11-16 12:50:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68291693] [2022-11-16 12:50:22,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:22,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880130104] [2022-11-16 12:50:22,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880130104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:22,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:22,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-11-16 12:50:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568698521] [2022-11-16 12:50:22,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:50:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:50:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:50:22,326 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:50:24,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 12:50:28,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 12:50:30,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 12:50:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:35,022 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-11-16 12:50:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:50:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2022-11-16 12:50:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:35,026 INFO L225 Difference]: With dead ends: 449 [2022-11-16 12:50:35,026 INFO L226 Difference]: Without dead ends: 443 [2022-11-16 12:50:35,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=89, Invalid=415, Unknown=2, NotChecked=0, Total=506 [2022-11-16 12:50:35,027 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:35,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-11-16 12:50:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-16 12:50:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-11-16 12:50:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-16 12:50:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-11-16 12:50:35,116 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-11-16 12:50:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:35,117 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-11-16 12:50:35,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:50:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-11-16 12:50:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-16 12:50:35,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:35,126 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:35,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 12:50:35,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:35,331 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-11-16 12:50:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602109339] [2022-11-16 12:50:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:35,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:35,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195444181] [2022-11-16 12:50:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:35,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:35,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:50:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:35,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:50:35,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:36,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-11-16 12:50:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:37,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602109339] [2022-11-16 12:50:37,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:37,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195444181] [2022-11-16 12:50:37,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195444181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:37,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:37,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-16 12:50:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932216993] [2022-11-16 12:50:37,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:37,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 12:50:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:37,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 12:50:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 12:50:37,425 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-16 12:50:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:39,465 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-11-16 12:50:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-16 12:50:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 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 229 [2022-11-16 12:50:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:39,470 INFO L225 Difference]: With dead ends: 929 [2022-11-16 12:50:39,471 INFO L226 Difference]: Without dead ends: 923 [2022-11-16 12:50:39,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-16 12:50:39,475 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 645 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:39,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 485 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:50:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-16 12:50:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-11-16 12:50:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-11-16 12:50:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-11-16 12:50:39,626 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-11-16 12:50:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:39,627 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-11-16 12:50:39,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-16 12:50:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-11-16 12:50:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-11-16 12:50:39,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:39,638 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:39,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:39,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:39,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-11-16 12:50:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:39,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456118906] [2022-11-16 12:50:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:39,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463256415] [2022-11-16 12:50:39,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:50:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:39,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:39,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:50:40,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:50:40,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:50:40,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 12:50:40,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:42,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-11-16 12:50:45,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:45,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456118906] [2022-11-16 12:50:45,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:50:45,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463256415] [2022-11-16 12:50:45,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463256415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:45,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:45,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-16 12:50:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431562772] [2022-11-16 12:50:45,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:45,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-16 12:50:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-16 12:50:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-11-16 12:50:45,741 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-16 12:50:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:52,635 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2022-11-16 12:50:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-16 12:50:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 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 469 [2022-11-16 12:50:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:52,645 INFO L225 Difference]: With dead ends: 1889 [2022-11-16 12:50:52,645 INFO L226 Difference]: Without dead ends: 1883 [2022-11-16 12:50:52,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2022-11-16 12:50:52,655 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 1936 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:52,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 1024 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 12:50:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-11-16 12:50:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2022-11-16 12:50:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1504 states have (on average 1.125) internal successors, (1692), 1504 states have internal predecessors, (1692), 188 states have call successors, (188), 188 states have call predecessors, (188), 187 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2022-11-16 12:50:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2022-11-16 12:50:52,885 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2022-11-16 12:50:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:52,886 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2022-11-16 12:50:52,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-16 12:50:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2022-11-16 12:50:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2022-11-16 12:50:52,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:52,925 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:52,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:53,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:53,132 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:53,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2022-11-16 12:50:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:53,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624806714] [2022-11-16 12:50:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:53,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:50:53,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96527715] [2022-11-16 12:50:53,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:50:53,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:53,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:53,187 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:53,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:50:54,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2022-11-16 12:50:54,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:50:54,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-16 12:50:54,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:50:59,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:51:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2022-11-16 12:51:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:05,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624806714] [2022-11-16 12:51:05,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:51:05,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96527715] [2022-11-16 12:51:05,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96527715] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:51:05,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:51:05,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-16 12:51:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166472335] [2022-11-16 12:51:05,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:51:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-16 12:51:05,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:05,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-16 12:51:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-11-16 12:51:05,013 INFO L87 Difference]: Start difference. First operand 1880 states and 2067 transitions. Second operand has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2022-11-16 12:51:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:11,622 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2022-11-16 12:51:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-16 12:51:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 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 949 [2022-11-16 12:51:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:11,632 INFO L225 Difference]: With dead ends: 2009 [2022-11-16 12:51:11,632 INFO L226 Difference]: Without dead ends: 2003 [2022-11-16 12:51:11,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1704 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2022-11-16 12:51:11,638 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1124 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:11,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 1066 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:51:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2022-11-16 12:51:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2022-11-16 12:51:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1600 states have (on average 1.125) internal successors, (1800), 1600 states have internal predecessors, (1800), 200 states have call successors, (200), 200 states have call predecessors, (200), 199 states have return successors, (199), 199 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:51:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2022-11-16 12:51:11,875 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2022-11-16 12:51:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:11,877 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2022-11-16 12:51:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2022-11-16 12:51:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2022-11-16 12:51:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2022-11-16 12:51:11,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:11,892 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:11,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:51:12,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:51:12,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:51:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2022-11-16 12:51:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:12,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944148871] [2022-11-16 12:51:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:12,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:51:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498008364] [2022-11-16 12:51:12,173 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:51:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:51:12,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:51:12,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:51:12,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:51:12,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 12:51:12,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:51:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:51:14,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:51:14,592 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:51:14,593 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:51:14,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:51:14,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:14,809 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2022-11-16 12:51:14,814 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:51:15,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:51:15 BoogieIcfgContainer [2022-11-16 12:51:15,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:51:15,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:51:15,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:51:15,081 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:51:15,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:12" (3/4) ... [2022-11-16 12:51:15,084 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:51:15,392 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:51:15,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:51:15,393 INFO L158 Benchmark]: Toolchain (without parser) took 63778.92ms. Allocated memory was 119.5MB in the beginning and 413.1MB in the end (delta: 293.6MB). Free memory was 78.2MB in the beginning and 201.8MB in the end (delta: -123.6MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. [2022-11-16 12:51:15,394 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 119.5MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:51:15,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.33ms. Allocated memory is still 119.5MB. Free memory was 78.0MB in the beginning and 92.7MB in the end (delta: -14.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:51:15,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.93ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 91.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:51:15,395 INFO L158 Benchmark]: Boogie Preprocessor took 19.88ms. Allocated memory is still 119.5MB. Free memory was 91.5MB in the beginning and 90.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:51:15,395 INFO L158 Benchmark]: RCFGBuilder took 367.10ms. Allocated memory is still 119.5MB. Free memory was 90.2MB in the beginning and 79.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:51:15,396 INFO L158 Benchmark]: TraceAbstraction took 62716.86ms. Allocated memory was 119.5MB in the beginning and 413.1MB in the end (delta: 293.6MB). Free memory was 79.0MB in the beginning and 241.7MB in the end (delta: -162.7MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2022-11-16 12:51:15,396 INFO L158 Benchmark]: Witness Printer took 311.34ms. Allocated memory is still 413.1MB. Free memory was 241.7MB in the beginning and 201.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-16 12:51:15,398 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.31ms. Allocated memory is still 119.5MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.33ms. Allocated memory is still 119.5MB. Free memory was 78.0MB in the beginning and 92.7MB in the end (delta: -14.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.93ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 91.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.88ms. Allocated memory is still 119.5MB. Free memory was 91.5MB in the beginning and 90.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.10ms. Allocated memory is still 119.5MB. Free memory was 90.2MB in the beginning and 79.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 62716.86ms. Allocated memory was 119.5MB in the beginning and 413.1MB in the end (delta: 293.6MB). Free memory was 79.0MB in the beginning and 241.7MB in the end (delta: -162.7MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. * Witness Printer took 311.34ms. Allocated memory is still 413.1MB. Free memory was 241.7MB in the beginning and 201.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. 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; VAL [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=-2126008764, X=2147483600, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-2126008764, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-2126008764, X=2147483600, x=0, x=0, x=0, y=0, Y=10737418] [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=-2126008764, x=0, x=0, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-2126008764, x=0, x=0, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-2104533928, X=2147483600, x=0, x=0, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=1, v=-2104533928, x=0, X=2147483600, x=0, x=1, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-2104533928, x=0, x=1, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-2104533928, x=10737418, X=2147483600, x=0, x=1, y=0, Y=10737418] [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=-2104533928, x=10737418, x=1, x=0, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-2104533928, X=2147483600, x=10737418, x=1, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-2083059092, X=2147483600, x=1, x=10737418, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=2, v=-2083059092, X=2147483600, x=2, x=0, x=10737418, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-2083059092, X=2147483600, x=2, x=0, x=10737418, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-2083059092, x=2, x=0, X=2147483600, x=21474836, Y=10737418, 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=-2083059092, x=2, X=2147483600, x=0, x=21474836, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-2083059092, x=0, x=21474836, x=2, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-2061584256, X=2147483600, x=0, x=21474836, x=2, y=0, Y=10737418] [L45] x++ VAL [counter=3, v=-2061584256, x=0, x=3, X=2147483600, x=21474836, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-2061584256, X=2147483600, x=21474836, x=0, x=3, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-2061584256, X=2147483600, x=3, x=0, x=32212254, Y=10737418, 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=-2061584256, x=0, x=32212254, x=3, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-2061584256, X=2147483600, x=32212254, x=3, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-2040109420, X=2147483600, x=32212254, x=0, x=3, y=0, Y=10737418] [L45] x++ VAL [counter=4, v=-2040109420, x=32212254, x=4, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-2040109420, x=4, x=0, X=2147483600, x=32212254, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-2040109420, x=0, X=2147483600, x=4, x=42949672, y=0, Y=10737418] [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=-2040109420, x=0, X=2147483600, x=42949672, x=4, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-2040109420, x=4, x=0, X=2147483600, x=42949672, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-2018634584, X=2147483600, x=0, x=4, x=42949672, y=0, Y=10737418] [L45] x++ VAL [counter=5, v=-2018634584, x=0, x=5, X=2147483600, x=42949672, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-2018634584, X=2147483600, x=0, x=5, x=42949672, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-2018634584, x=0, X=2147483600, x=5, x=53687090, y=0, Y=10737418] [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=-2018634584, x=0, x=53687090, x=5, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-2018634584, x=0, X=2147483600, x=5, x=53687090, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-1997159748, x=5, X=2147483600, x=53687090, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=6, v=-1997159748, x=0, x=6, X=2147483600, x=53687090, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-1997159748, x=6, x=0, X=2147483600, x=53687090, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-1997159748, x=64424508, X=2147483600, x=0, x=6, y=0, Y=10737418] [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=-1997159748, X=2147483600, x=0, x=64424508, x=6, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-1997159748, x=6, x=64424508, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-1975684912, x=64424508, X=2147483600, x=6, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=7, v=-1975684912, x=64424508, X=2147483600, x=7, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-1975684912, x=64424508, X=2147483600, x=0, x=7, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-1975684912, x=75161926, x=0, X=2147483600, x=7, Y=10737418, 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=-1975684912, x=75161926, x=7, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-1975684912, x=75161926, X=2147483600, x=7, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-1954210076, x=0, x=7, X=2147483600, x=75161926, y=0, Y=10737418] [L45] x++ VAL [counter=8, v=-1954210076, x=0, x=8, X=2147483600, x=75161926, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-1954210076, X=2147483600, x=0, x=75161926, x=8, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-1954210076, x=8, X=2147483600, x=85899344, x=0, Y=10737418, 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=-1954210076, x=85899344, x=8, x=0, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-1954210076, x=0, x=8, X=2147483600, x=85899344, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-1932735240, X=2147483600, x=0, x=85899344, x=8, y=0, Y=10737418] [L45] x++ VAL [counter=9, v=-1932735240, X=2147483600, x=0, x=9, x=85899344, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-1932735240, x=85899344, x=0, X=2147483600, x=9, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-1932735240, x=0, x=9, x=96636762, X=2147483600, Y=10737418, 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=-1932735240, x=96636762, x=0, X=2147483600, x=9, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-1932735240, X=2147483600, x=0, x=96636762, x=9, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-1911260404, x=0, x=9, X=2147483600, x=96636762, Y=10737418, y=0] [L45] x++ VAL [counter=10, v=-1911260404, X=2147483600, x=10, x=96636762, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-1911260404, x=10, X=2147483600, x=0, x=96636762, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-1911260404, X=2147483600, x=0, x=10, x=107374180, y=0, Y=10737418] [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=-1911260404, X=2147483600, x=107374180, x=0, x=10, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-1911260404, x=10, X=2147483600, x=0, x=107374180, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-1889785568, x=10, x=0, x=107374180, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=11, v=-1889785568, x=11, x=0, X=2147483600, x=107374180, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-1889785568, X=2147483600, x=0, x=11, x=107374180, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-1889785568, x=0, X=2147483600, x=11, x=118111598, y=0, Y=10737418] [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=-1889785568, x=118111598, X=2147483600, x=0, x=11, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-1889785568, X=2147483600, x=11, x=118111598, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-1868310732, x=0, X=2147483600, x=118111598, x=11, y=0, Y=10737418] [L45] x++ VAL [counter=12, v=-1868310732, x=118111598, x=0, x=12, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-1868310732, x=118111598, x=12, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-1868310732, X=2147483600, x=12, x=0, x=128849016, Y=10737418, y=0] [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=-1868310732, X=2147483600, x=128849016, x=12, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-1868310732, x=12, x=0, X=2147483600, x=128849016, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-1846835896, x=12, X=2147483600, x=0, x=128849016, y=0, Y=10737418] [L45] x++ VAL [counter=13, v=-1846835896, X=2147483600, x=128849016, x=13, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-1846835896, x=0, x=128849016, X=2147483600, x=13, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-1846835896, X=2147483600, x=13, x=139586434, x=0, y=0, Y=10737418] [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=-1846835896, x=0, X=2147483600, x=139586434, x=13, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-1846835896, x=13, x=139586434, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-1825361060, x=0, x=13, X=2147483600, x=139586434, Y=10737418, y=0] [L45] x++ VAL [counter=14, v=-1825361060, X=2147483600, x=14, x=139586434, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-1825361060, X=2147483600, x=14, x=0, x=139586434, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-1825361060, x=14, X=2147483600, x=0, x=150323852, y=0, Y=10737418] [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=-1825361060, X=2147483600, x=150323852, x=14, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-1825361060, X=2147483600, x=0, x=14, x=150323852, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-1803886224, x=14, X=2147483600, x=150323852, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=15, v=-1803886224, X=2147483600, x=15, x=150323852, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-1803886224, x=15, x=150323852, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-1803886224, x=161061270, x=15, x=0, X=2147483600, Y=10737418, 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=-1803886224, x=0, X=2147483600, x=15, x=161061270, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-1803886224, x=0, x=161061270, X=2147483600, x=15, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-1782411388, X=2147483600, x=161061270, x=15, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=16, v=-1782411388, x=161061270, x=16, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-1782411388, x=161061270, x=16, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-1782411388, x=0, X=2147483600, x=171798688, x=16, y=0, Y=10737418] [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=-1782411388, X=2147483600, x=171798688, x=0, x=16, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-1782411388, x=16, x=0, X=2147483600, x=171798688, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-1760936552, x=0, x=16, x=171798688, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=17, v=-1760936552, x=0, x=17, X=2147483600, x=171798688, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-1760936552, X=2147483600, x=171798688, x=17, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-1760936552, x=0, x=17, X=2147483600, x=182536106, Y=10737418, 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=-1760936552, X=2147483600, x=0, x=17, x=182536106, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-1760936552, x=182536106, X=2147483600, x=17, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-1739461716, x=17, x=182536106, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=18, v=-1739461716, X=2147483600, x=0, x=182536106, x=18, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-1739461716, X=2147483600, x=0, x=18, x=182536106, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-1739461716, x=18, x=0, x=193273524, X=2147483600, Y=10737418, 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=-1739461716, x=193273524, X=2147483600, x=0, x=18, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-1739461716, x=0, x=193273524, X=2147483600, x=18, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-1717986880, X=2147483600, x=0, x=193273524, x=18, Y=10737418, y=0] [L45] x++ VAL [counter=19, v=-1717986880, x=19, x=193273524, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-1717986880, x=193273524, x=0, x=19, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-1717986880, x=19, x=204010942, x=0, X=2147483600, Y=10737418, 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=-1717986880, x=0, x=204010942, X=2147483600, x=19, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-1717986880, x=0, x=204010942, x=19, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-1696512044, X=2147483600, x=0, x=19, x=204010942, y=0, Y=10737418] [L45] x++ VAL [counter=20, v=-1696512044, X=2147483600, x=0, x=204010942, x=20, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-1696512044, x=204010942, x=0, x=20, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-1696512044, x=214748360, x=20, X=2147483600, x=0, Y=10737418, 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=-1696512044, x=20, X=2147483600, x=214748360, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-1696512044, x=20, X=2147483600, x=214748360, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-1675037208, x=0, x=214748360, X=2147483600, x=20, Y=10737418, y=0] [L45] x++ VAL [counter=21, v=-1675037208, x=21, x=0, x=214748360, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-1675037208, X=2147483600, x=21, x=214748360, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-1675037208, x=0, X=2147483600, x=21, x=225485778, Y=10737418, 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=-1675037208, x=225485778, X=2147483600, x=0, x=21, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-1675037208, x=21, x=225485778, x=0, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-1653562372, X=2147483600, x=21, x=225485778, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=22, v=-1653562372, X=2147483600, x=225485778, x=0, x=22, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-1653562372, X=2147483600, x=225485778, x=22, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-1653562372, x=22, x=236223196, X=2147483600, x=0, Y=10737418, 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=-1653562372, x=236223196, x=0, X=2147483600, x=22, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-1653562372, x=0, x=22, X=2147483600, x=236223196, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-1632087536, x=22, x=0, x=236223196, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=23, v=-1632087536, x=23, X=2147483600, x=0, x=236223196, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-1632087536, x=236223196, X=2147483600, x=23, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-1632087536, X=2147483600, x=0, x=23, x=246960614, Y=10737418, 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=-1632087536, x=246960614, x=23, X=2147483600, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-1632087536, x=246960614, X=2147483600, x=23, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-1610612700, x=0, x=246960614, x=23, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=24, v=-1610612700, X=2147483600, x=246960614, x=24, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-1610612700, x=246960614, X=2147483600, x=0, x=24, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-1610612700, x=0, x=24, X=2147483600, x=257698032, Y=10737418, 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=-1610612700, x=0, x=24, x=257698032, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-1610612700, x=0, x=257698032, X=2147483600, x=24, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-1589137864, X=2147483600, x=24, x=257698032, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=25, v=-1589137864, x=25, x=0, X=2147483600, x=257698032, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-1589137864, X=2147483600, x=257698032, x=25, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-1589137864, x=268435450, x=25, X=2147483600, x=0, y=0, Y=10737418] [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=-1589137864, x=0, X=2147483600, x=25, x=268435450, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-1589137864, x=25, x=0, x=268435450, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-1567663028, x=268435450, X=2147483600, x=25, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=26, v=-1567663028, X=2147483600, x=268435450, x=0, x=26, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-1567663028, x=268435450, X=2147483600, x=26, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-1567663028, x=0, x=26, X=2147483600, x=279172868, Y=10737418, 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=-1567663028, X=2147483600, x=279172868, x=26, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-1567663028, X=2147483600, x=279172868, x=0, x=26, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-1546188192, X=2147483600, x=0, x=279172868, x=26, y=0, Y=10737418] [L45] x++ VAL [counter=27, v=-1546188192, x=27, X=2147483600, x=279172868, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-1546188192, X=2147483600, x=0, x=279172868, x=27, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-1546188192, X=2147483600, x=0, x=289910286, x=27, y=0, Y=10737418] [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=-1546188192, X=2147483600, x=0, x=27, x=289910286, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-1546188192, x=0, X=2147483600, x=289910286, x=27, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-1524713356, X=2147483600, x=27, x=289910286, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=28, v=-1524713356, X=2147483600, x=28, x=289910286, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-1524713356, x=28, x=289910286, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-1524713356, x=300647704, x=0, X=2147483600, x=28, Y=10737418, 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=-1524713356, x=0, X=2147483600, x=300647704, x=28, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-1524713356, x=0, x=28, x=300647704, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-1503238520, x=300647704, X=2147483600, x=28, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=29, v=-1503238520, x=300647704, X=2147483600, x=0, x=29, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-1503238520, x=0, x=29, x=300647704, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-1503238520, x=29, X=2147483600, x=311385122, x=0, y=0, Y=10737418] [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=-1503238520, x=0, x=311385122, x=29, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-1503238520, x=311385122, X=2147483600, x=29, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-1481763684, X=2147483600, x=0, x=29, x=311385122, y=0, Y=10737418] [L45] x++ VAL [counter=30, v=-1481763684, X=2147483600, x=311385122, x=30, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-1481763684, x=30, x=0, X=2147483600, x=311385122, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-1481763684, x=0, X=2147483600, x=30, x=322122540, Y=10737418, 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=-1481763684, x=30, x=322122540, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-1481763684, x=30, X=2147483600, x=322122540, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-1460288848, X=2147483600, x=322122540, x=0, x=30, y=0, Y=10737418] [L45] x++ VAL [counter=31, v=-1460288848, x=31, x=0, X=2147483600, x=322122540, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-1460288848, x=322122540, x=0, X=2147483600, x=31, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-1460288848, x=31, x=0, x=332859958, X=2147483600, y=0, Y=10737418] [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=-1460288848, x=332859958, x=0, X=2147483600, x=31, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-1460288848, x=332859958, x=0, X=2147483600, x=31, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-1438814012, x=0, x=31, x=332859958, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=32, v=-1438814012, X=2147483600, x=332859958, x=0, x=32, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-1438814012, X=2147483600, x=0, x=32, x=332859958, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-1438814012, X=2147483600, x=343597376, x=32, x=0, Y=10737418, 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=-1438814012, X=2147483600, x=32, x=0, x=343597376, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-1438814012, x=0, x=32, x=343597376, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-1417339176, x=32, x=343597376, x=0, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=33, v=-1417339176, x=0, x=343597376, x=33, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-1417339176, X=2147483600, x=33, x=343597376, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-1417339176, x=33, x=354334794, X=2147483600, x=0, y=0, Y=10737418] [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=-1417339176, x=354334794, x=0, X=2147483600, x=33, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-1417339176, x=33, x=0, x=354334794, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-1395864340, x=0, X=2147483600, x=354334794, x=33, Y=10737418, y=0] [L45] x++ VAL [counter=34, v=-1395864340, x=34, x=354334794, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-1395864340, x=0, x=34, X=2147483600, x=354334794, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-1395864340, x=0, X=2147483600, x=34, x=365072212, y=0, Y=10737418] [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=-1395864340, x=365072212, x=0, x=34, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-1395864340, x=365072212, X=2147483600, x=34, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-1374389504, x=34, X=2147483600, x=365072212, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=35, v=-1374389504, x=35, x=365072212, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-1374389504, x=365072212, X=2147483600, x=0, x=35, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-1374389504, X=2147483600, x=35, x=375809630, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-1374389504, x=35, X=2147483600, x=375809630, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-1374389504, x=35, X=2147483600, x=375809630, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-1352914668, x=35, X=2147483600, x=375809630, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=36, v=-1352914668, x=375809630, x=0, X=2147483600, x=36, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-1352914668, x=0, X=2147483600, x=36, x=375809630, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-1352914668, X=2147483600, x=386547048, x=0, x=36, y=0, Y=10737418] [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=-1352914668, x=386547048, X=2147483600, x=0, x=36, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-1352914668, X=2147483600, x=36, x=0, x=386547048, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-1331439832, x=0, x=36, x=386547048, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=37, v=-1331439832, X=2147483600, x=37, x=0, x=386547048, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-1331439832, x=37, X=2147483600, x=0, x=386547048, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-1331439832, x=0, x=397284466, X=2147483600, x=37, Y=10737418, 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=-1331439832, x=0, x=37, X=2147483600, x=397284466, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-1331439832, x=37, x=0, X=2147483600, x=397284466, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-1309964996, x=0, x=37, X=2147483600, x=397284466, y=0, Y=10737418] [L45] x++ VAL [counter=38, v=-1309964996, x=0, X=2147483600, x=38, x=397284466, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-1309964996, X=2147483600, x=38, x=0, x=397284466, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-1309964996, x=38, x=0, X=2147483600, x=408021884, y=0, Y=10737418] [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=-1309964996, X=2147483600, x=38, x=0, x=408021884, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-1309964996, x=0, x=408021884, x=38, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-1288490160, x=408021884, x=0, X=2147483600, x=38, Y=10737418, y=0] [L45] x++ VAL [counter=39, v=-1288490160, X=2147483600, x=39, x=408021884, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-1288490160, x=408021884, X=2147483600, x=0, x=39, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-1288490160, X=2147483600, x=0, x=418759302, x=39, y=0, Y=10737418] [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=-1288490160, X=2147483600, x=39, x=0, x=418759302, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-1288490160, x=39, X=2147483600, x=0, x=418759302, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-1267015324, x=39, x=418759302, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=40, v=-1267015324, x=40, X=2147483600, x=0, x=418759302, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-1267015324, x=418759302, x=0, X=2147483600, x=40, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-1267015324, x=0, x=429496720, X=2147483600, x=40, y=0, Y=10737418] [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=-1267015324, X=2147483600, x=0, x=429496720, x=40, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-1267015324, X=2147483600, x=429496720, x=0, x=40, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-1245540488, x=0, X=2147483600, x=40, x=429496720, Y=10737418, y=0] [L45] x++ VAL [counter=41, v=-1245540488, x=429496720, x=41, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-1245540488, X=2147483600, x=429496720, x=0, x=41, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-1245540488, X=2147483600, x=0, x=41, x=440234138, y=0, Y=10737418] [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=-1245540488, x=41, x=440234138, x=0, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-1245540488, x=41, x=440234138, x=0, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-1224065652, x=0, x=41, X=2147483600, x=440234138, Y=10737418, y=0] [L45] x++ VAL [counter=42, v=-1224065652, x=440234138, x=42, x=0, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-1224065652, x=440234138, x=42, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-1224065652, x=450971556, x=42, x=0, X=2147483600, y=0, Y=10737418] [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=-1224065652, x=450971556, x=0, X=2147483600, x=42, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-1224065652, x=450971556, x=42, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-1202590816, x=0, x=42, X=2147483600, x=450971556, Y=10737418, y=0] [L45] x++ VAL [counter=43, v=-1202590816, x=0, x=450971556, x=43, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-1202590816, X=2147483600, x=0, x=450971556, x=43, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-1202590816, x=461708974, x=43, X=2147483600, x=0, Y=10737418, 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=-1202590816, x=43, x=461708974, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-1202590816, X=2147483600, x=43, x=0, x=461708974, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-1181115980, X=2147483600, x=43, x=0, x=461708974, Y=10737418, y=0] [L45] x++ VAL [counter=44, v=-1181115980, x=0, x=461708974, x=44, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-1181115980, X=2147483600, x=44, x=0, x=461708974, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-1181115980, x=0, X=2147483600, x=472446392, x=44, Y=10737418, 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=-1181115980, x=0, x=472446392, X=2147483600, x=44, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-1181115980, x=44, X=2147483600, x=0, x=472446392, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-1159641144, x=0, x=44, X=2147483600, x=472446392, Y=10737418, y=0] [L45] x++ VAL [counter=45, v=-1159641144, X=2147483600, x=0, x=472446392, x=45, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-1159641144, x=0, x=472446392, x=45, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-1159641144, x=45, x=0, X=2147483600, x=483183810, y=0, Y=10737418] [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=-1159641144, x=45, X=2147483600, x=483183810, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-1159641144, x=483183810, x=0, x=45, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-1138166308, X=2147483600, x=45, x=483183810, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=46, v=-1138166308, x=0, x=483183810, x=46, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-1138166308, x=46, x=483183810, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-1138166308, x=0, x=46, X=2147483600, x=493921228, Y=10737418, 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=-1138166308, X=2147483600, x=46, x=0, x=493921228, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-1138166308, x=46, x=0, X=2147483600, x=493921228, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-1116691472, x=493921228, x=0, X=2147483600, x=46, y=0, Y=10737418] [L45] x++ VAL [counter=47, v=-1116691472, x=493921228, X=2147483600, x=47, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-1116691472, x=0, x=493921228, x=47, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-1116691472, x=47, X=2147483600, x=504658646, x=0, Y=10737418, 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=-1116691472, x=47, x=0, X=2147483600, x=504658646, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-1116691472, x=0, X=2147483600, x=47, x=504658646, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1095216636, x=0, x=47, X=2147483600, x=504658646, Y=10737418, y=0] [L45] x++ VAL [counter=48, v=-1095216636, X=2147483600, x=48, x=0, x=504658646, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1095216636, x=0, x=48, X=2147483600, x=504658646, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1095216636, X=2147483600, x=515396064, x=48, x=0, y=0, Y=10737418] [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=-1095216636, x=48, x=515396064, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1095216636, x=48, x=515396064, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=-1073741800, x=0, x=48, x=515396064, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=49, v=-1073741800, x=0, x=49, x=515396064, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-1073741800, x=0, x=515396064, X=2147483600, x=49, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-1073741800, x=49, x=526133482, X=2147483600, x=0, Y=10737418, 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=-1073741800, X=2147483600, x=526133482, x=49, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=-1073741800, x=49, x=0, x=526133482, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=50, v=-1052266964, x=49, X=2147483600, x=526133482, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=50, v=-1052266964, x=50, x=0, X=2147483600, x=526133482, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-1052266964, x=0, x=50, X=2147483600, x=526133482, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-1052266964, x=50, X=2147483600, x=536870900, x=0, Y=10737418, 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=-1052266964, x=50, X=2147483600, x=0, x=536870900, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=51, v=-1052266964, X=2147483600, x=50, x=536870900, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=51, v=-1030792128, x=50, x=536870900, x=0, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=51, v=-1030792128, x=536870900, x=51, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-1030792128, x=0, X=2147483600, x=536870900, x=51, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-1030792128, x=547608318, X=2147483600, x=51, x=0, y=0, Y=10737418] [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=-1030792128, X=2147483600, x=547608318, x=51, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=52, v=-1030792128, x=547608318, X=2147483600, x=0, x=51, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=52, v=-1009317292, x=0, x=547608318, x=51, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=52, v=-1009317292, x=0, x=547608318, x=52, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-1009317292, x=52, x=0, X=2147483600, x=547608318, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-1009317292, x=0, x=52, x=558345736, X=2147483600, y=0, Y=10737418] [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=-1009317292, x=52, x=0, x=558345736, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=53, v=-1009317292, x=0, X=2147483600, x=558345736, x=52, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=53, v=-987842456, x=52, X=2147483600, x=0, x=558345736, y=0, Y=10737418] [L45] x++ VAL [counter=53, v=-987842456, X=2147483600, x=53, x=0, x=558345736, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-987842456, x=53, x=0, X=2147483600, x=558345736, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-987842456, x=569083154, x=0, X=2147483600, x=53, Y=10737418, 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=-987842456, x=569083154, x=53, X=2147483600, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=54, v=-987842456, x=0, X=2147483600, x=569083154, x=53, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=54, v=-966367620, x=569083154, X=2147483600, x=0, x=53, Y=10737418, y=0] [L45] x++ VAL [counter=54, v=-966367620, X=2147483600, x=54, x=0, x=569083154, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-966367620, X=2147483600, x=54, x=569083154, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-966367620, X=2147483600, x=54, x=579820572, x=0, Y=10737418, 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=-966367620, x=0, x=54, X=2147483600, x=579820572, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=55, v=-966367620, x=579820572, x=54, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=55, v=-944892784, x=54, x=579820572, x=0, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=55, v=-944892784, X=2147483600, x=579820572, x=55, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-944892784, x=0, x=55, x=579820572, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-944892784, x=590557990, x=55, X=2147483600, x=0, Y=10737418, 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=-944892784, x=0, X=2147483600, x=590557990, x=55, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=56, v=-944892784, x=55, X=2147483600, x=0, x=590557990, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=56, v=-923417948, x=0, x=55, X=2147483600, x=590557990, y=0, Y=10737418] [L45] x++ VAL [counter=56, v=-923417948, x=590557990, X=2147483600, x=0, x=56, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-923417948, x=590557990, x=56, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-923417948, x=56, x=601295408, X=2147483600, x=0, y=0, Y=10737418] [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=-923417948, X=2147483600, x=56, x=601295408, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=57, v=-923417948, x=601295408, x=0, x=56, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=57, v=-901943112, x=0, x=56, x=601295408, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=57, v=-901943112, X=2147483600, x=57, x=0, x=601295408, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-901943112, x=601295408, X=2147483600, x=0, x=57, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-901943112, X=2147483600, x=612032826, x=0, x=57, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=-901943112, x=0, x=612032826, X=2147483600, x=57, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=58, v=-901943112, X=2147483600, x=57, x=612032826, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=58, v=-880468276, x=612032826, x=57, x=0, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=58, v=-880468276, x=612032826, X=2147483600, x=58, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-880468276, x=0, x=58, x=612032826, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-880468276, x=0, x=622770244, X=2147483600, x=58, Y=10737418, y=0] [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=-880468276, x=58, X=2147483600, x=0, x=622770244, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=59, v=-880468276, x=58, x=622770244, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=59, v=-858993440, X=2147483600, x=622770244, x=0, x=58, Y=10737418, y=0] [L45] x++ VAL [counter=59, v=-858993440, x=0, X=2147483600, x=622770244, x=59, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-858993440, x=59, x=0, x=622770244, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-858993440, x=633507662, X=2147483600, x=59, x=0, Y=10737418, 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=-858993440, x=633507662, X=2147483600, x=0, x=59, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=60, v=-858993440, x=0, x=633507662, x=59, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=60, v=-837518604, x=633507662, x=0, x=59, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=60, v=-837518604, x=633507662, x=0, X=2147483600, x=60, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-837518604, x=0, X=2147483600, x=633507662, x=60, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-837518604, x=60, x=644245080, x=0, X=2147483600, y=0, Y=10737418] [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=-837518604, x=0, x=60, x=644245080, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=61, v=-837518604, x=0, x=644245080, x=60, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=61, v=-816043768, X=2147483600, x=0, x=644245080, x=60, Y=10737418, y=0] [L45] x++ VAL [counter=61, v=-816043768, x=61, X=2147483600, x=0, x=644245080, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=-816043768, x=0, X=2147483600, x=644245080, x=61, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=-816043768, x=61, x=0, x=654982498, X=2147483600, Y=10737418, 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=-816043768, x=654982498, x=0, x=61, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=62, v=-816043768, x=654982498, X=2147483600, x=61, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=62, v=-794568932, x=61, X=2147483600, x=654982498, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=62, v=-794568932, X=2147483600, x=62, x=0, x=654982498, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-794568932, X=2147483600, x=654982498, x=62, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-794568932, x=0, x=62, X=2147483600, x=665719916, Y=10737418, 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=-794568932, x=665719916, X=2147483600, x=0, x=62, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=63, v=-794568932, X=2147483600, x=665719916, x=62, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=63, v=-773094096, x=0, X=2147483600, x=62, x=665719916, Y=10737418, y=0] [L45] x++ VAL [counter=63, v=-773094096, x=0, x=63, x=665719916, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-773094096, x=665719916, x=63, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-773094096, X=2147483600, x=676457334, x=0, x=63, y=0, Y=10737418] [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=-773094096, X=2147483600, x=676457334, x=63, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=64, v=-773094096, X=2147483600, x=63, x=676457334, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=64, v=-751619260, x=0, X=2147483600, x=676457334, x=63, y=0, Y=10737418] [L45] x++ VAL [counter=64, v=-751619260, x=676457334, x=0, x=64, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-751619260, x=64, x=676457334, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-751619260, x=64, x=0, x=687194752, X=2147483600, Y=10737418, 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=-751619260, X=2147483600, x=687194752, x=64, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=65, v=-751619260, x=64, X=2147483600, x=687194752, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=65, v=-730144424, X=2147483600, x=687194752, x=0, x=64, Y=10737418, y=0] [L45] x++ VAL [counter=65, v=-730144424, X=2147483600, x=65, x=0, x=687194752, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-730144424, x=0, x=687194752, X=2147483600, x=65, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-730144424, x=0, X=2147483600, x=65, x=697932170, y=0, Y=10737418] [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=-730144424, x=0, x=697932170, X=2147483600, x=65, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=66, v=-730144424, x=65, X=2147483600, x=697932170, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=66, v=-708669588, x=697932170, X=2147483600, x=0, x=65, y=0, Y=10737418] [L45] x++ VAL [counter=66, v=-708669588, x=0, X=2147483600, x=697932170, x=66, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-708669588, X=2147483600, x=697932170, x=66, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-708669588, X=2147483600, x=66, x=0, x=708669588, y=0, Y=10737418] [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=-708669588, x=708669588, x=0, X=2147483600, x=66, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=67, v=-708669588, X=2147483600, x=0, x=66, x=708669588, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=67, v=-687194752, x=0, x=66, x=708669588, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=67, v=-687194752, x=0, x=67, x=708669588, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-687194752, x=708669588, x=67, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-687194752, X=2147483600, x=719407006, x=0, x=67, y=0, Y=10737418] [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=-687194752, X=2147483600, x=0, x=67, x=719407006, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=68, v=-687194752, x=0, x=719407006, X=2147483600, x=67, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=68, v=-665719916, x=0, x=719407006, x=67, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=68, v=-665719916, x=68, x=0, x=719407006, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-665719916, x=0, X=2147483600, x=719407006, x=68, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-665719916, x=0, X=2147483600, x=730144424, x=68, y=0, Y=10737418] [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=-665719916, x=730144424, X=2147483600, x=0, x=68, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=69, v=-665719916, X=2147483600, x=730144424, x=68, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=69, v=-644245080, X=2147483600, x=730144424, x=0, x=68, Y=10737418, y=0] [L45] x++ VAL [counter=69, v=-644245080, x=69, x=730144424, X=2147483600, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-644245080, x=69, x=730144424, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-644245080, x=69, X=2147483600, x=740881842, x=0, y=0, Y=10737418] [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=-644245080, x=740881842, X=2147483600, x=0, x=69, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=70, v=-644245080, x=740881842, x=69, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=70, v=-622770244, x=0, x=740881842, x=69, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=70, v=-622770244, x=740881842, x=0, x=70, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-622770244, X=2147483600, x=740881842, x=70, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-622770244, x=751619260, x=0, X=2147483600, x=70, Y=10737418, 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=-622770244, x=751619260, x=0, X=2147483600, x=70, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=71, v=-622770244, x=70, x=751619260, X=2147483600, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=71, v=-601295408, x=70, x=751619260, x=0, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=71, v=-601295408, X=2147483600, x=0, x=751619260, x=71, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-601295408, x=0, x=71, x=751619260, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-601295408, X=2147483600, x=71, x=0, x=762356678, y=0, Y=10737418] [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=-601295408, X=2147483600, x=762356678, x=71, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=72, v=-601295408, X=2147483600, x=762356678, x=71, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=72, v=-579820572, x=0, x=762356678, X=2147483600, x=71, y=0, Y=10737418] [L45] x++ VAL [counter=72, v=-579820572, x=72, X=2147483600, x=0, x=762356678, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-579820572, X=2147483600, x=762356678, x=72, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-579820572, x=72, X=2147483600, x=0, x=773094096, y=0, Y=10737418] [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=-579820572, X=2147483600, x=0, x=773094096, x=72, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=73, v=-579820572, X=2147483600, x=773094096, x=72, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=73, v=-558345736, x=773094096, x=72, X=2147483600, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=73, v=-558345736, X=2147483600, x=773094096, x=73, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-558345736, X=2147483600, x=73, x=0, x=773094096, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-558345736, x=783831514, X=2147483600, x=73, x=0, Y=10737418, 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=-558345736, x=0, X=2147483600, x=73, x=783831514, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=74, v=-558345736, x=783831514, x=73, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=74, v=-536870900, x=73, X=2147483600, x=0, x=783831514, y=0, Y=10737418] [L45] x++ VAL [counter=74, v=-536870900, x=783831514, X=2147483600, x=0, x=74, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-536870900, x=783831514, x=74, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-536870900, x=74, X=2147483600, x=794568932, x=0, y=0, Y=10737418] [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=-536870900, x=0, x=794568932, x=74, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=75, v=-536870900, x=74, X=2147483600, x=0, x=794568932, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=75, v=-515396064, x=0, X=2147483600, x=74, x=794568932, Y=10737418, y=0] [L45] x++ VAL [counter=75, v=-515396064, x=794568932, x=75, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-515396064, x=794568932, X=2147483600, x=75, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-515396064, X=2147483600, x=75, x=0, x=805306350, Y=10737418, 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=-515396064, x=0, X=2147483600, x=75, x=805306350, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=76, v=-515396064, x=75, X=2147483600, x=805306350, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=76, v=-493921228, x=75, X=2147483600, x=0, x=805306350, Y=10737418, y=0] [L45] x++ VAL [counter=76, v=-493921228, x=805306350, x=76, x=0, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-493921228, X=2147483600, x=76, x=805306350, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-493921228, x=76, x=816043768, X=2147483600, x=0, y=0, Y=10737418] [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=-493921228, x=816043768, x=0, x=76, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=77, v=-493921228, x=76, x=816043768, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=77, v=-472446392, x=0, x=816043768, X=2147483600, x=76, Y=10737418, y=0] [L45] x++ VAL [counter=77, v=-472446392, x=816043768, x=77, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-472446392, x=816043768, x=77, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-472446392, x=77, x=0, X=2147483600, x=826781186, y=0, Y=10737418] [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=-472446392, X=2147483600, x=77, x=0, x=826781186, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=78, v=-472446392, x=0, X=2147483600, x=826781186, x=77, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=78, v=-450971556, x=0, X=2147483600, x=826781186, x=77, Y=10737418, y=0] [L45] x++ VAL [counter=78, v=-450971556, X=2147483600, x=0, x=826781186, x=78, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-450971556, X=2147483600, x=0, x=826781186, x=78, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-450971556, x=0, x=78, X=2147483600, x=837518604, Y=10737418, 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=-450971556, x=837518604, x=0, x=78, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=79, v=-450971556, X=2147483600, x=837518604, x=78, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=79, v=-429496720, X=2147483600, x=837518604, x=0, x=78, y=0, Y=10737418] [L45] x++ VAL [counter=79, v=-429496720, x=79, X=2147483600, x=837518604, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-429496720, x=837518604, x=79, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-429496720, x=848256022, x=79, X=2147483600, x=0, y=0, Y=10737418] [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=-429496720, x=79, x=0, X=2147483600, x=848256022, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=80, v=-429496720, x=0, x=848256022, X=2147483600, x=79, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=80, v=-408021884, x=79, x=848256022, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=80, v=-408021884, x=0, x=848256022, X=2147483600, x=80, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-408021884, x=80, x=0, X=2147483600, x=848256022, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-408021884, x=0, X=2147483600, x=80, x=858993440, Y=10737418, y=0] [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=-408021884, x=858993440, x=0, X=2147483600, x=80, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=81, v=-408021884, X=2147483600, x=80, x=0, x=858993440, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=81, v=-386547048, X=2147483600, x=858993440, x=80, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=81, v=-386547048, X=2147483600, x=81, x=858993440, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-386547048, x=858993440, X=2147483600, x=81, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-386547048, x=0, x=869730858, x=81, X=2147483600, y=0, Y=10737418] [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=-386547048, x=81, X=2147483600, x=0, x=869730858, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=82, v=-386547048, x=869730858, x=81, x=0, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=82, v=-365072212, x=81, x=0, x=869730858, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=82, v=-365072212, x=0, x=869730858, X=2147483600, x=82, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-365072212, X=2147483600, x=869730858, x=0, x=82, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-365072212, X=2147483600, x=0, x=82, x=880468276, y=0, Y=10737418] [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=-365072212, x=0, X=2147483600, x=82, x=880468276, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=83, v=-365072212, x=82, X=2147483600, x=0, x=880468276, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=83, v=-343597376, x=82, x=0, X=2147483600, x=880468276, Y=10737418, y=0] [L45] x++ VAL [counter=83, v=-343597376, X=2147483600, x=880468276, x=0, x=83, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-343597376, x=0, x=880468276, x=83, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-343597376, x=891205694, X=2147483600, x=83, x=0, y=0, Y=10737418] [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=-343597376, X=2147483600, x=83, x=891205694, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=84, v=-343597376, X=2147483600, x=891205694, x=0, x=83, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=84, v=-322122540, x=0, x=891205694, x=83, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=84, v=-322122540, x=891205694, x=84, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-322122540, x=0, x=84, x=891205694, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-322122540, X=2147483600, x=84, x=901943112, x=0, Y=10737418, 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=-322122540, x=901943112, X=2147483600, x=0, x=84, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=85, v=-322122540, X=2147483600, x=901943112, x=84, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=85, v=-300647704, x=901943112, x=0, x=84, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=85, v=-300647704, x=0, x=901943112, X=2147483600, x=85, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-300647704, X=2147483600, x=0, x=901943112, x=85, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-300647704, x=0, X=2147483600, x=912680530, x=85, y=0, Y=10737418] [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=-300647704, X=2147483600, x=85, x=0, x=912680530, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=86, v=-300647704, x=85, X=2147483600, x=0, x=912680530, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=86, v=-279172868, x=0, X=2147483600, x=85, x=912680530, y=0, Y=10737418] [L45] x++ VAL [counter=86, v=-279172868, x=86, x=0, X=2147483600, x=912680530, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-279172868, X=2147483600, x=912680530, x=86, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-279172868, x=86, x=0, X=2147483600, x=923417948, Y=10737418, 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=-279172868, X=2147483600, x=86, x=0, x=923417948, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=87, v=-279172868, X=2147483600, x=0, x=86, x=923417948, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=87, v=-257698032, X=2147483600, x=923417948, x=0, x=86, y=0, Y=10737418] [L45] x++ VAL [counter=87, v=-257698032, x=87, x=923417948, x=0, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-257698032, x=923417948, x=87, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-257698032, X=2147483600, x=934155366, x=0, x=87, Y=10737418, 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=-257698032, X=2147483600, x=934155366, x=87, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=88, v=-257698032, X=2147483600, x=934155366, x=87, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=88, v=-236223196, x=87, x=0, x=934155366, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=88, v=-236223196, x=934155366, x=88, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-236223196, X=2147483600, x=934155366, x=0, x=88, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-236223196, x=944892784, x=0, X=2147483600, x=88, Y=10737418, 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=-236223196, x=88, x=944892784, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=89, v=-236223196, x=0, X=2147483600, x=944892784, x=88, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=89, v=-214748360, x=88, x=944892784, x=0, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=89, v=-214748360, x=944892784, X=2147483600, x=89, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-214748360, x=89, x=944892784, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-214748360, x=89, x=0, x=955630202, X=2147483600, y=0, Y=10737418] [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=-214748360, X=2147483600, x=0, x=89, x=955630202, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=90, v=-214748360, x=89, x=0, x=955630202, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=90, v=-193273524, x=0, x=955630202, X=2147483600, x=89, y=0, Y=10737418] [L45] x++ VAL [counter=90, v=-193273524, x=955630202, X=2147483600, x=90, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-193273524, X=2147483600, x=90, x=0, x=955630202, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-193273524, X=2147483600, x=90, x=966367620, x=0, y=0, Y=10737418] [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=-193273524, x=966367620, x=90, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=91, v=-193273524, X=2147483600, x=0, x=90, x=966367620, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=91, v=-171798688, x=966367620, X=2147483600, x=90, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=91, v=-171798688, x=91, x=0, X=2147483600, x=966367620, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-171798688, x=966367620, x=91, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-171798688, x=0, x=91, X=2147483600, x=977105038, Y=10737418, 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=-171798688, x=91, x=0, x=977105038, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=92, v=-171798688, X=2147483600, x=977105038, x=91, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=92, v=-150323852, X=2147483600, x=0, x=977105038, x=91, y=0, Y=10737418] [L45] x++ VAL [counter=92, v=-150323852, x=92, x=977105038, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-150323852, X=2147483600, x=0, x=92, x=977105038, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-150323852, x=987842456, x=0, X=2147483600, x=92, Y=10737418, 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=-150323852, x=0, x=92, X=2147483600, x=987842456, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=93, v=-150323852, X=2147483600, x=0, x=987842456, x=92, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=93, v=-128849016, x=0, x=987842456, x=92, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=93, v=-128849016, x=0, X=2147483600, x=93, x=987842456, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-128849016, X=2147483600, x=0, x=93, x=987842456, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-128849016, x=93, x=998579874, X=2147483600, x=0, Y=10737418, 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=-128849016, x=0, X=2147483600, x=93, x=998579874, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=94, v=-128849016, x=93, x=0, x=998579874, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=94, v=-107374180, x=998579874, X=2147483600, x=93, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=94, v=-107374180, x=998579874, X=2147483600, x=94, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-107374180, x=0, X=2147483600, x=998579874, x=94, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-107374180, x=1009317292, x=0, x=94, X=2147483600, y=0, Y=10737418] [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=-107374180, X=2147483600, x=0, x=1009317292, x=94, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=95, v=-107374180, X=2147483600, x=94, x=0, x=1009317292, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=95, v=-85899344, X=2147483600, x=94, x=1009317292, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=95, v=-85899344, x=1009317292, X=2147483600, x=95, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-85899344, x=1009317292, x=95, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-85899344, x=1020054710, X=2147483600, x=95, x=0, Y=10737418, 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=-85899344, x=95, X=2147483600, x=1020054710, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=96, v=-85899344, x=0, X=2147483600, x=1020054710, x=95, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=96, v=-64424508, X=2147483600, x=1020054710, x=95, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=96, v=-64424508, x=1020054710, x=0, X=2147483600, x=96, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-64424508, x=0, X=2147483600, x=1020054710, x=96, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-64424508, x=96, x=1030792128, X=2147483600, x=0, y=0, Y=10737418] [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=-64424508, X=2147483600, x=1030792128, x=0, x=96, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=97, v=-64424508, x=96, x=0, X=2147483600, x=1030792128, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=97, v=-42949672, X=2147483600, x=1030792128, x=96, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=97, v=-42949672, x=97, x=1030792128, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-42949672, x=0, x=97, X=2147483600, x=1030792128, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-42949672, x=0, X=2147483600, x=1041529546, x=97, y=0, Y=10737418] [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=-42949672, X=2147483600, x=0, x=1041529546, x=97, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=98, v=-42949672, x=97, x=0, x=1041529546, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=98, v=-21474836, X=2147483600, x=1041529546, x=97, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=98, v=-21474836, X=2147483600, x=1041529546, x=98, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-21474836, x=98, X=2147483600, x=0, x=1041529546, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-21474836, x=1052266964, X=2147483600, x=0, x=98, y=0, Y=10737418] [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=-21474836, x=1052266964, X=2147483600, x=98, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=99, v=-21474836, x=1052266964, x=98, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=99, v=0, x=1052266964, X=2147483600, x=98, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=99, v=0, x=1052266964, X=2147483600, x=99, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=0, x=1052266964, X=2147483600, x=99, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=0, X=2147483600, x=0, x=1063004382, x=99, Y=10737418, 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=0, x=99, x=1063004382, x=0, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=100, v=0, X=2147483600, x=99, x=1063004382, x=0, y=0, Y=10737418] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100, v=-4273492364, x=99, x=0, x=1063004382, X=2147483600, Y=10737418, y=1] [L45] x++ VAL [counter=100, v=-4273492364, x=1063004382, x=0, X=2147483600, x=100, Y=10737418, y=1] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-4273492364, x=1063004382, X=2147483600, x=100, x=0, Y=10737418, y=1] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-4273492364, x=100, x=100, X=2147483600, x=1073741800, y=1, Y=10737418] [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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.4s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 4213 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4212 mSDsluCounter, 3416 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3006 mSDsCounter, 963 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2828 IncrementalHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 963 mSolverCounterUnsat, 410 mSDtfsCounter, 2828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4480 GetRequests, 3747 SyntacticMatches, 91 SemanticMatches, 642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17034 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=10, InterpolantAutomatonStates: 622, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 4181 ConstructedInterpolants, 0 QuantifiedInterpolants, 11579 SizeOfPredicates, 203 NumberOfNonLiveVariables, 4894 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 28148/120006 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:51:15,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_757014aa-628d-44fa-85d7-69d9c56c9383/bin/uautomizer-tPACEb0tL8/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