./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/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_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:10:17,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:10:17,265 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:10:17,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:10:17,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:10:17,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:10:17,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:10:17,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:10:17,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:10:17,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:10:17,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:10:17,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:10:17,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:10:17,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:10:17,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:10:17,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:10:17,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:10:17,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:10:17,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:10:17,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:10:17,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:10:17,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:10:17,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:10:17,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:10:17,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:10:17,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:10:17,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:10:17,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:10:17,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:10:17,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:10:17,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:10:17,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:10:17,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:17,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:10:17,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:10:17,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:10:17,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:10:17,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:17,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:10:17,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:10:17,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:10:17,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:10:17,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:10:17,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:10:17,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:10:17,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:10:17,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:10:17,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:10:17,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2024-11-24 01:10:17,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:10:17,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:10:17,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:10:17,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:10:17,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:10:17,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-11-24 01:10:20,931 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/data/a7a13c1d6/f7de28ae7b104eb586b7741c725270c1/FLAG5c6d285e4 [2024-11-24 01:10:21,195 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:10:21,196 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-11-24 01:10:21,206 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/data/a7a13c1d6/f7de28ae7b104eb586b7741c725270c1/FLAG5c6d285e4 [2024-11-24 01:10:21,524 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/data/a7a13c1d6/f7de28ae7b104eb586b7741c725270c1 [2024-11-24 01:10:21,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:10:21,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:10:21,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:10:21,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:10:21,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:10:21,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3df3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21, skipping insertion in model container [2024-11-24 01:10:21,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:10:21,730 WARN L250 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_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-11-24 01:10:21,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:10:21,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:10:21,769 WARN L250 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_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-11-24 01:10:21,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:10:21,792 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:10:21,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21 WrapperNode [2024-11-24 01:10:21,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:10:21,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:10:21,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:10:21,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:10:21,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,828 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-24 01:10:21,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:10:21,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:10:21,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:10:21,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:10:21,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 01:10:21,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:10:21,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:10:21,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:10:21,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:10:21,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:21,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:10:21,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:10:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:10:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:10:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:10:21,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:10:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-24 01:10:21,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-24 01:10:21,996 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:10:21,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:10:22,153 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-24 01:10:22,153 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:10:22,162 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:10:22,163 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 01:10:22,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:22 BoogieIcfgContainer [2024-11-24 01:10:22,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:10:22,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:10:22,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:10:22,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:10:22,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:21" (1/3) ... [2024-11-24 01:10:22,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef6cc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:22, skipping insertion in model container [2024-11-24 01:10:22,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21" (2/3) ... [2024-11-24 01:10:22,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef6cc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:22, skipping insertion in model container [2024-11-24 01:10:22,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:22" (3/3) ... [2024-11-24 01:10:22,175 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2024-11-24 01:10:22,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:10:22,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound100.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:10:22,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:10:22,269 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@16271d87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:10:22,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:10:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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) [2024-11-24 01:10:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-24 01:10:22,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:22,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:22,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 798370362, now seen corresponding path program 1 times [2024-11-24 01:10:22,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:22,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888879033] [2024-11-24 01:10:22,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:22,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888879033] [2024-11-24 01:10:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888879033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:22,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:10:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599963748] [2024-11-24 01:10:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:22,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:10:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:22,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:10:22,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:10:22,472 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-24 01:10:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:22,486 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-24 01:10:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:10:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2024-11-24 01:10:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:22,494 INFO L225 Difference]: With dead ends: 40 [2024-11-24 01:10:22,494 INFO L226 Difference]: Without dead ends: 17 [2024-11-24 01:10:22,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:10:22,500 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:22,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-24 01:10:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-24 01:10:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-24 01:10:22,536 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-11-24 01:10:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-24 01:10:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-24 01:10:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-24 01:10:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-24 01:10:22,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:22,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:22,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:10:22,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash 295298814, now seen corresponding path program 1 times [2024-11-24 01:10:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103977586] [2024-11-24 01:10:22,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:22,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:10:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120631864] [2024-11-24 01:10:22,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:22,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:22,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:10:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:22,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 01:10:22,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:22,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:10:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103977586] [2024-11-24 01:10:22,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 01:10:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120631864] [2024-11-24 01:10:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120631864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:10:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208967534] [2024-11-24 01:10:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:22,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:10:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:22,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:10:22,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:22,911 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-24 01:10:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:23,056 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-24 01:10:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:10:23,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2024-11-24 01:10:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:23,058 INFO L225 Difference]: With dead ends: 32 [2024-11-24 01:10:23,058 INFO L226 Difference]: Without dead ends: 30 [2024-11-24 01:10:23,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:10:23,059 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:23,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-24 01:10:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-24 01:10:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:10:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-24 01:10:23,067 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-11-24 01:10:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:23,067 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-24 01:10:23,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-24 01:10:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-24 01:10:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-24 01:10:23,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:23,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:23,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:23,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:23,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash 368316555, now seen corresponding path program 1 times [2024-11-24 01:10:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630167018] [2024-11-24 01:10:23,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630167018] [2024-11-24 01:10:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630167018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148960704] [2024-11-24 01:10:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:23,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:23,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:23,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:23,353 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-24 01:10:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:23,373 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-24 01:10:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:10:23,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-11-24 01:10:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:23,375 INFO L225 Difference]: With dead ends: 33 [2024-11-24 01:10:23,375 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:10:23,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:23,377 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:23,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:10:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-24 01:10:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:10:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-24 01:10:23,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2024-11-24 01:10:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:23,384 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-24 01:10:23,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-24 01:10:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-24 01:10:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:10:23,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:23,385 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:23,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:10:23,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:23,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash -156697420, now seen corresponding path program 1 times [2024-11-24 01:10:23,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119470076] [2024-11-24 01:10:23,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:10:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684486935] [2024-11-24 01:10:23,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:23,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:23,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:10:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:23,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 01:10:23,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:23,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:10:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119470076] [2024-11-24 01:10:23,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 01:10:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684486935] [2024-11-24 01:10:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684486935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:10:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839183613] [2024-11-24 01:10:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:10:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:10:23,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:23,743 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:23,873 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-24 01:10:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:10:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-24 01:10:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:23,874 INFO L225 Difference]: With dead ends: 35 [2024-11-24 01:10:23,874 INFO L226 Difference]: Without dead ends: 27 [2024-11-24 01:10:23,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:10:23,876 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:23,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-24 01:10:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-24 01:10:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-11-24 01:10:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-24 01:10:23,882 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2024-11-24 01:10:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:23,883 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-24 01:10:23,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-24 01:10:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-24 01:10:23,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:23,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:23,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:10:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:24,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash -716773380, now seen corresponding path program 1 times [2024-11-24 01:10:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088699579] [2024-11-24 01:10:24,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:10:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578542] [2024-11-24 01:10:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:24,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:24,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:24,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:24,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:10:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:24,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-24 01:10:24,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:24,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:10:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088699579] [2024-11-24 01:10:24,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 01:10:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578542] [2024-11-24 01:10:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:24,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:10:24,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-24 01:10:24,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369490384] [2024-11-24 01:10:24,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:24,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 01:10:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:24,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 01:10:24,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:10:24,578 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:10:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:24,818 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-24 01:10:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:10:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-24 01:10:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:24,822 INFO L225 Difference]: With dead ends: 44 [2024-11-24 01:10:24,822 INFO L226 Difference]: Without dead ends: 40 [2024-11-24 01:10:24,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:10:24,823 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:24,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-24 01:10:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2024-11-24 01:10:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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) [2024-11-24 01:10:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-24 01:10:24,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2024-11-24 01:10:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:24,839 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-24 01:10:24,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:10:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-24 01:10:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-24 01:10:24,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:24,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:24,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:10:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:25,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -643755639, now seen corresponding path program 1 times [2024-11-24 01:10:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45532015] [2024-11-24 01:10:25,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:25,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45532015] [2024-11-24 01:10:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45532015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162350809] [2024-11-24 01:10:25,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:25,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:25,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:10:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:25,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:10:25,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:25,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162350809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:25,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:10:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-24 01:10:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567324994] [2024-11-24 01:10:25,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:10:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:25,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:10:25,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:10:25,404 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-24 01:10:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:25,504 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-24 01:10:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:10:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-24 01:10:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:25,506 INFO L225 Difference]: With dead ends: 72 [2024-11-24 01:10:25,506 INFO L226 Difference]: Without dead ends: 66 [2024-11-24 01:10:25,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:10:25,510 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:25,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-24 01:10:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-11-24 01:10:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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) [2024-11-24 01:10:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-24 01:10:25,528 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2024-11-24 01:10:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:25,529 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-24 01:10:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-24 01:10:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-24 01:10:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-24 01:10:25,530 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:25,534 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:25,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 01:10:25,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-24 01:10:25,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:25,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash 935756278, now seen corresponding path program 1 times [2024-11-24 01:10:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658143151] [2024-11-24 01:10:25,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:10:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114927586] [2024-11-24 01:10:25,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:25,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:25,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:25,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:10:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:25,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-24 01:10:25,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 01:10:26,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 01:10:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658143151] [2024-11-24 01:10:26,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 01:10:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114927586] [2024-11-24 01:10:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114927586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:26,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:10:26,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-24 01:10:26,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415693121] [2024-11-24 01:10:26,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:10:26,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:26,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:10:26,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:10:26,315 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:10:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:26,602 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-24 01:10:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:10:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 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 27 [2024-11-24 01:10:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:26,605 INFO L225 Difference]: With dead ends: 86 [2024-11-24 01:10:26,605 INFO L226 Difference]: Without dead ends: 80 [2024-11-24 01:10:26,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:10:26,606 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:26,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:10:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-24 01:10:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-24 01:10:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-24 01:10:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-24 01:10:26,647 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 27 [2024-11-24 01:10:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:26,648 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-24 01:10:26,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:10:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-11-24 01:10:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-24 01:10:26,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:26,649 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:26,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:10:26,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-24 01:10:26,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:26,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash -85312076, now seen corresponding path program 1 times [2024-11-24 01:10:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:26,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460007656] [2024-11-24 01:10:26,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:10:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770244751] [2024-11-24 01:10:26,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:26,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:26,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:10:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:26,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-24 01:10:26,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-24 01:10:27,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-24 01:10:27,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460007656] [2024-11-24 01:10:27,822 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 01:10:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770244751] [2024-11-24 01:10:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770244751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:27,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:10:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2024-11-24 01:10:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806084221] [2024-11-24 01:10:27,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:27,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 01:10:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:27,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 01:10:27,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-24 01:10:27,827 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:10:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:28,814 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-24 01:10:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-24 01:10:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2024-11-24 01:10:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:28,818 INFO L225 Difference]: With dead ends: 87 [2024-11-24 01:10:28,818 INFO L226 Difference]: Without dead ends: 79 [2024-11-24 01:10:28,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-11-24 01:10:28,820 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:28,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 169 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:10:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-24 01:10:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2024-11-24 01:10:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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) [2024-11-24 01:10:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-24 01:10:28,847 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2024-11-24 01:10:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:28,848 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-24 01:10:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:10:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-24 01:10:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-24 01:10:28,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:28,849 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:28,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:29,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-24 01:10:29,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:29,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 380685067, now seen corresponding path program 2 times [2024-11-24 01:10:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34296247] [2024-11-24 01:10:29,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:10:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:29,080 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:10:29,080 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-24 01:10:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34296247] [2024-11-24 01:10:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34296247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886091563] [2024-11-24 01:10:29,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:10:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:29,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:29,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:29,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 01:10:29,630 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:10:29,631 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:29,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-24 01:10:29,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:29,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-24 01:10:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886091563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:29,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:10:29,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2024-11-24 01:10:29,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741276055] [2024-11-24 01:10:29,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:29,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 01:10:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:29,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 01:10:29,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:10:29,954 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-24 01:10:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:30,228 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2024-11-24 01:10:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-24 01:10:30,229 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 53 [2024-11-24 01:10:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:30,231 INFO L225 Difference]: With dead ends: 126 [2024-11-24 01:10:30,234 INFO L226 Difference]: Without dead ends: 120 [2024-11-24 01:10:30,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-24 01:10:30,236 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:30,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-24 01:10:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-24 01:10:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.1122448979591837) internal successors, (109), 98 states have internal predecessors, (109), 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) [2024-11-24 01:10:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-11-24 01:10:30,284 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 53 [2024-11-24 01:10:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:30,284 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-11-24 01:10:30,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-24 01:10:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-11-24 01:10:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 01:10:30,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:30,289 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:30,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 01:10:30,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-24 01:10:30,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:30,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1638130997, now seen corresponding path program 3 times [2024-11-24 01:10:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473920997] [2024-11-24 01:10:30,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:10:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:30,707 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-24 01:10:30,707 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 20 proven. 335 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-24 01:10:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473920997] [2024-11-24 01:10:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473920997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078315459] [2024-11-24 01:10:32,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:10:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:32,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:32,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 01:10:32,090 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-24 01:10:32,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:32,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-24 01:10:32,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-24 01:10:32,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-24 01:10:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078315459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:33,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:10:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 36 [2024-11-24 01:10:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091507506] [2024-11-24 01:10:33,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:33,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-24 01:10:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:33,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-24 01:10:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2024-11-24 01:10:33,193 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 36 states, 32 states have (on average 3.125) internal successors, (100), 35 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-24 01:10:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:36,705 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2024-11-24 01:10:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-24 01:10:36,705 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 3.125) internal successors, (100), 35 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 119 [2024-11-24 01:10:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:36,707 INFO L225 Difference]: With dead ends: 254 [2024-11-24 01:10:36,707 INFO L226 Difference]: Without dead ends: 244 [2024-11-24 01:10:36,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4344 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1964, Invalid=12556, Unknown=0, NotChecked=0, Total=14520 [2024-11-24 01:10:36,715 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 240 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:36,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 117 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 01:10:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-24 01:10:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2024-11-24 01:10:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 197 states have (on average 1.1116751269035532) internal successors, (219), 197 states have internal predecessors, (219), 22 states have call successors, (22), 22 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-24 01:10:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2024-11-24 01:10:36,781 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 119 [2024-11-24 01:10:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:36,781 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2024-11-24 01:10:36,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 3.125) internal successors, (100), 35 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-24 01:10:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2024-11-24 01:10:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-24 01:10:36,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:36,787 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:36,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:36,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-24 01:10:36,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2053046965, now seen corresponding path program 1 times [2024-11-24 01:10:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128705720] [2024-11-24 01:10:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-24 01:10:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128705720] [2024-11-24 01:10:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128705720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423829304] [2024-11-24 01:10:37,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:37,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:37,642 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:37,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 01:10:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:37,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 01:10:37,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:37,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-24 01:10:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423829304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:38,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:10:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-11-24 01:10:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314952177] [2024-11-24 01:10:38,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:38,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-24 01:10:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:38,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-24 01:10:38,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-11-24 01:10:38,434 INFO L87 Difference]: Start difference. First operand 241 states and 262 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-24 01:10:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:39,190 INFO L93 Difference]: Finished difference Result 536 states and 595 transitions. [2024-11-24 01:10:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-24 01:10:39,191 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 130 [2024-11-24 01:10:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:39,198 INFO L225 Difference]: With dead ends: 536 [2024-11-24 01:10:39,198 INFO L226 Difference]: Without dead ends: 530 [2024-11-24 01:10:39,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-11-24 01:10:39,200 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 139 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:39,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 266 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:10:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-24 01:10:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2024-11-24 01:10:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 431 states have (on average 1.111368909512761) internal successors, (479), 431 states have internal predecessors, (479), 48 states have call successors, (48), 48 states have call predecessors, (48), 47 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 01:10:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 574 transitions. [2024-11-24 01:10:39,309 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 574 transitions. Word has length 130 [2024-11-24 01:10:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:39,310 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 574 transitions. [2024-11-24 01:10:39,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-24 01:10:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 574 transitions. [2024-11-24 01:10:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-24 01:10:39,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:39,314 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:39,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-24 01:10:39,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:39,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:39,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:39,515 INFO L85 PathProgramCache]: Analyzing trace with hash 182128013, now seen corresponding path program 2 times [2024-11-24 01:10:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:39,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745570064] [2024-11-24 01:10:39,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:10:39,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:39,603 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:10:39,604 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:10:41,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745570064] [2024-11-24 01:10:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745570064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7055980] [2024-11-24 01:10:41,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:10:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:41,689 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:41,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-24 01:10:41,871 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:10:41,872 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:41,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-24 01:10:41,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 3084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:42,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:10:43,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7055980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:10:43,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:10:43,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 55 [2024-11-24 01:10:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914908898] [2024-11-24 01:10:43,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-24 01:10:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:43,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-24 01:10:43,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=1609, Unknown=0, NotChecked=0, Total=2970 [2024-11-24 01:10:43,687 INFO L87 Difference]: Start difference. First operand 527 states and 574 transitions. Second operand has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-24 01:10:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:45,634 INFO L93 Difference]: Finished difference Result 1108 states and 1232 transitions. [2024-11-24 01:10:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-24 01:10:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 273 [2024-11-24 01:10:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:45,642 INFO L225 Difference]: With dead ends: 1108 [2024-11-24 01:10:45,642 INFO L226 Difference]: Without dead ends: 1102 [2024-11-24 01:10:45,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-11-24 01:10:45,646 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 349 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:45,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 467 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:10:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-24 01:10:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1099. [2024-11-24 01:10:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 899 states have (on average 1.1112347052280311) internal successors, (999), 899 states have internal predecessors, (999), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-24 01:10:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1198 transitions. [2024-11-24 01:10:45,822 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1198 transitions. Word has length 273 [2024-11-24 01:10:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:45,823 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1198 transitions. [2024-11-24 01:10:45,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-24 01:10:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1198 transitions. [2024-11-24 01:10:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-11-24 01:10:45,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:45,835 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:45,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:46,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:46,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:46,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:46,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1615446477, now seen corresponding path program 3 times [2024-11-24 01:10:46,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:46,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251217810] [2024-11-24 01:10:46,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:10:46,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:46,722 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-24 01:10:46,723 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 100 proven. 8675 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-24 01:10:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251217810] [2024-11-24 01:10:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251217810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946080795] [2024-11-24 01:10:57,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:10:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:57,879 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:57,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-24 01:10:58,337 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-24 01:10:58,337 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:10:58,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-24 01:10:58,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 100 proven. 13575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:59,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 100 proven. 8675 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-24 01:11:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946080795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:11:05,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:11:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 53, 54] total 142 [2024-11-24 01:11:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893076887] [2024-11-24 01:11:05,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:05,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2024-11-24 01:11:05,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:05,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2024-11-24 01:11:05,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8726, Invalid=11296, Unknown=0, NotChecked=0, Total=20022 [2024-11-24 01:11:05,079 INFO L87 Difference]: Start difference. First operand 1099 states and 1198 transitions. Second operand has 142 states, 142 states have (on average 5.887323943661972) internal successors, (836), 142 states have internal predecessors, (836), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2024-11-24 01:11:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:12,370 INFO L93 Difference]: Finished difference Result 2208 states and 2456 transitions. [2024-11-24 01:11:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-11-24 01:11:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 142 states have (on average 5.887323943661972) internal successors, (836), 142 states have internal predecessors, (836), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) Word has length 559 [2024-11-24 01:11:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:12,382 INFO L225 Difference]: With dead ends: 2208 [2024-11-24 01:11:12,383 INFO L226 Difference]: Without dead ends: 2202 [2024-11-24 01:11:12,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1066 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4897 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=15305, Invalid=25701, Unknown=0, NotChecked=0, Total=41006 [2024-11-24 01:11:12,390 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 903 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:12,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 890 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:11:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2024-11-24 01:11:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2199. [2024-11-24 01:11:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1799 states have (on average 1.1111728738187883) internal successors, (1999), 1799 states have internal predecessors, (1999), 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) [2024-11-24 01:11:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2398 transitions. [2024-11-24 01:11:12,631 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 2398 transitions. Word has length 559 [2024-11-24 01:11:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:12,632 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 2398 transitions. [2024-11-24 01:11:12,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 142 states have (on average 5.887323943661972) internal successors, (836), 142 states have internal predecessors, (836), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2024-11-24 01:11:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2398 transitions. [2024-11-24 01:11:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2024-11-24 01:11:12,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:12,677 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:12,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-24 01:11:12,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:12,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:11:12,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1867392269, now seen corresponding path program 4 times [2024-11-24 01:11:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706740358] [2024-11-24 01:11:12,879 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 01:11:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:14,023 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 01:11:14,024 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-24 01:11:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456176211] [2024-11-24 01:11:14,042 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 01:11:14,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:14,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:14,044 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:14,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-24 01:11:15,487 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 01:11:15,487 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 01:11:15,487 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:11:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:11:17,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:11:17,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:11:17,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:11:17,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-24 01:11:17,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:17,288 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:17,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:11:17,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:11:17 BoogieIcfgContainer [2024-11-24 01:11:17,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:11:17,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:11:17,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:11:17,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:11:17,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:22" (3/4) ... [2024-11-24 01:11:17,597 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-24 01:11:17,924 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 604. [2024-11-24 01:11:18,276 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-24 01:11:18,279 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-24 01:11:18,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:11:18,280 INFO L158 Benchmark]: Toolchain (without parser) took 56752.64ms. Allocated memory was 117.4MB in the beginning and 687.9MB in the end (delta: 570.4MB). Free memory was 93.2MB in the beginning and 547.3MB in the end (delta: -454.0MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2024-11-24 01:11:18,280 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:11:18,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.20ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 81.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:11:18,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:11:18,281 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:11:18,281 INFO L158 Benchmark]: RCFGBuilder took 305.38ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 68.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:11:18,281 INFO L158 Benchmark]: TraceAbstraction took 55427.68ms. Allocated memory was 117.4MB in the beginning and 687.9MB in the end (delta: 570.4MB). Free memory was 68.1MB in the beginning and 610.2MB in the end (delta: -542.1MB). Peak memory consumption was 405.5MB. Max. memory is 16.1GB. [2024-11-24 01:11:18,282 INFO L158 Benchmark]: Witness Printer took 684.74ms. Allocated memory is still 687.9MB. Free memory was 610.2MB in the beginning and 547.3MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-24 01:11:18,284 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.20ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 81.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 305.38ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 68.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 55427.68ms. Allocated memory was 117.4MB in the beginning and 687.9MB in the end (delta: 570.4MB). Free memory was 68.1MB in the beginning and 610.2MB in the end (delta: -542.1MB). Peak memory consumption was 405.5MB. Max. memory is 16.1GB. * Witness Printer took 684.74ms. Allocated memory is still 687.9MB. Free memory was 610.2MB in the beginning and 547.3MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; 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 [X=200, Y=1, counter=0, v=-198, x=0, y=0] [L31] EXPR counter++ VAL [X=200, Y=1, counter=1, v=-198, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=1, v=-198, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=1, v=-198, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=1, v=-198, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=1, v=-196, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=200, Y=1, counter=1, v=-196, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=1] [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, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=2, v=-196, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=2, v=-194, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=200, Y=1, counter=2, v=-194, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=2] [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, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=3, v=-194, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=3, v=-192, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=200, Y=1, counter=3, v=-192, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=3] [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, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=4, v=-192, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=4, v=-190, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=200, Y=1, counter=4, v=-190, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=4] [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, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=5, v=-190, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=5, v=-188, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=200, Y=1, counter=5, v=-188, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=5] [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, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=6, v=-188, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=6, v=-186, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=200, Y=1, counter=6, v=-186, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=6] [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, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=7, v=-186, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=7, v=-184, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=200, Y=1, counter=7, v=-184, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=7] [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, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=8, v=-184, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=8, v=-182, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=200, Y=1, counter=8, v=-182, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=8] [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, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=9, v=-182, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=9, v=-180, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=200, Y=1, counter=9, v=-180, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=9] [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, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=10, v=-180, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=10, v=-178, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=200, Y=1, counter=10, v=-178, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=10] [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, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=11, v=-178, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=11, v=-176, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=200, Y=1, counter=11, v=-176, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=11] [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, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=12, v=-176, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=12, v=-174, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=200, Y=1, counter=12, v=-174, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=12] [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, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=13, v=-174, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=13, v=-172, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=200, Y=1, counter=13, v=-172, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=13] [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, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=14, v=-172, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=14, v=-170, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=200, Y=1, counter=14, v=-170, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=14] [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, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=15, v=-170, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=15, v=-168, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=200, Y=1, counter=15, v=-168, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=15] [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, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=16, v=-168, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=16, v=-166, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=200, Y=1, counter=16, v=-166, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=16] [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, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=17, v=-166, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=17, v=-164, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=200, Y=1, counter=17, v=-164, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=17] [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, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=18, v=-164, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=18, v=-162, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=200, Y=1, counter=18, v=-162, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=18] [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, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=19, v=-162, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=19, v=-160, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=200, Y=1, counter=19, v=-160, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=19] [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, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=20, v=-160, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=20, v=-158, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=200, Y=1, counter=20, v=-158, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=20] [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, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=21, v=-158, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=21, v=-156, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=200, Y=1, counter=21, v=-156, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=21] [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, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=22, v=-156, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=22, v=-154, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=200, Y=1, counter=22, v=-154, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=22] [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, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=23, v=-154, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=23, v=-152, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=200, Y=1, counter=23, v=-152, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=23] [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, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=24, v=-152, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=24, v=-150, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=200, Y=1, counter=24, v=-150, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=24] [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, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=25, v=-150, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=25, v=-148, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=200, Y=1, counter=25, v=-148, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=25] [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, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=26, v=-148, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=26, v=-146, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=200, Y=1, counter=26, v=-146, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=26] [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, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=27, v=-146, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=27, v=-144, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=200, Y=1, counter=27, v=-144, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=27] [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, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=28, v=-144, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=28, v=-142, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=200, Y=1, counter=28, v=-142, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=28] [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, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=29, v=-142, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=29, v=-140, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=200, Y=1, counter=29, v=-140, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=29] [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, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=30, v=-140, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=30, v=-138, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=200, Y=1, counter=30, v=-138, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=30] [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, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=31, v=-138, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=31, v=-136, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=200, Y=1, counter=31, v=-136, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=31] [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, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=32, v=-136, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=32, v=-134, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=200, Y=1, counter=32, v=-134, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=32] [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, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=33, v=-134, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=33, v=-132, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=200, Y=1, counter=33, v=-132, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=33] [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, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=34, v=-132, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=34, v=-130, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=200, Y=1, counter=34, v=-130, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=34] [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, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=35, v=-130, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=35, v=-128, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=200, Y=1, counter=35, v=-128, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=35] [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, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=36, v=-128, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=36, v=-126, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=200, Y=1, counter=36, v=-126, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=36] [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, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=37, v=-126, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=37, v=-124, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=200, Y=1, counter=37, v=-124, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=37] [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, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=38, v=-124, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=38, v=-122, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=200, Y=1, counter=38, v=-122, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=38] [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, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=39, v=-122, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=39, v=-120, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=200, Y=1, counter=39, v=-120, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=39] [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, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=40, v=-120, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=40, v=-118, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=200, Y=1, counter=40, v=-118, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=40] [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, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=41, v=-118, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=41, v=-116, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=200, Y=1, counter=41, v=-116, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=41] [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, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=42, v=-116, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=42, v=-114, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=200, Y=1, counter=42, v=-114, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=42] [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, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=43, v=-114, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=43, v=-112, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=200, Y=1, counter=43, v=-112, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=43] [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, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=44, v=-112, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=44, v=-110, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=200, Y=1, counter=44, v=-110, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=44] [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, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=45, v=-110, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=45, v=-108, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=200, Y=1, counter=45, v=-108, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=45] [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, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=46, v=-108, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=46, v=-106, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=200, Y=1, counter=46, v=-106, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=46] [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, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=47, v=-106, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=47, v=-104, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=200, Y=1, counter=47, v=-104, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=47] [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, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=48, v=-104, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=48, v=-102, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=200, Y=1, counter=48, v=-102, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=48] [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, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=49, v=-102, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=49, v=-100, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=200, Y=1, counter=49, v=-100, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=49] [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, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=50, v=-100, x=49, xy=0, y=0, yx=49] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=50, v=-98, x=49, xy=0, y=0, yx=49] [L45] x++ VAL [X=200, Y=1, counter=50, v=-98, x=50, xy=0, y=0, yx=49] [L31] EXPR counter++ VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=49] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=50] [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, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=51, v=-98, x=50, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=51, v=-96, x=50, xy=0, y=0, yx=50] [L45] x++ VAL [X=200, Y=1, counter=51, v=-96, x=51, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=50] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=51] [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, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=51] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=52, v=-96, x=51, xy=0, y=0, yx=51] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=52, v=-94, x=51, xy=0, y=0, yx=51] [L45] x++ VAL [X=200, Y=1, counter=52, v=-94, x=52, xy=0, y=0, yx=51] [L31] EXPR counter++ VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=51] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=52] [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, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=53, v=-94, x=52, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=53, v=-92, x=52, xy=0, y=0, yx=52] [L45] x++ VAL [X=200, Y=1, counter=53, v=-92, x=53, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=52] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=53] [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, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=53] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=54, v=-92, x=53, xy=0, y=0, yx=53] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=54, v=-90, x=53, xy=0, y=0, yx=53] [L45] x++ VAL [X=200, Y=1, counter=54, v=-90, x=54, xy=0, y=0, yx=53] [L31] EXPR counter++ VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=53] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=54] [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, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=55, v=-90, x=54, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=55, v=-88, x=54, xy=0, y=0, yx=54] [L45] x++ VAL [X=200, Y=1, counter=55, v=-88, x=55, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=54] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=55] [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, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=55] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=56, v=-88, x=55, xy=0, y=0, yx=55] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=56, v=-86, x=55, xy=0, y=0, yx=55] [L45] x++ VAL [X=200, Y=1, counter=56, v=-86, x=56, xy=0, y=0, yx=55] [L31] EXPR counter++ VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=55] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=56] [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, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=57, v=-86, x=56, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=57, v=-84, x=56, xy=0, y=0, yx=56] [L45] x++ VAL [X=200, Y=1, counter=57, v=-84, x=57, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=56] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=57] [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, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=57] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=58, v=-84, x=57, xy=0, y=0, yx=57] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=58, v=-82, x=57, xy=0, y=0, yx=57] [L45] x++ VAL [X=200, Y=1, counter=58, v=-82, x=58, xy=0, y=0, yx=57] [L31] EXPR counter++ VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=57] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=58] [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, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=59, v=-82, x=58, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=59, v=-80, x=58, xy=0, y=0, yx=58] [L45] x++ VAL [X=200, Y=1, counter=59, v=-80, x=59, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=58] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=59] [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, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=59] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=60, v=-80, x=59, xy=0, y=0, yx=59] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=60, v=-78, x=59, xy=0, y=0, yx=59] [L45] x++ VAL [X=200, Y=1, counter=60, v=-78, x=60, xy=0, y=0, yx=59] [L31] EXPR counter++ VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=59] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=60] [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, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=61, v=-78, x=60, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=61, v=-76, x=60, xy=0, y=0, yx=60] [L45] x++ VAL [X=200, Y=1, counter=61, v=-76, x=61, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=60] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=61] [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, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=61] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=62, v=-76, x=61, xy=0, y=0, yx=61] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=62, v=-74, x=61, xy=0, y=0, yx=61] [L45] x++ VAL [X=200, Y=1, counter=62, v=-74, x=62, xy=0, y=0, yx=61] [L31] EXPR counter++ VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=61] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=62] [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, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=63, v=-74, x=62, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=63, v=-72, x=62, xy=0, y=0, yx=62] [L45] x++ VAL [X=200, Y=1, counter=63, v=-72, x=63, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=62] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=63] [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, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=63] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=64, v=-72, x=63, xy=0, y=0, yx=63] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=64, v=-70, x=63, xy=0, y=0, yx=63] [L45] x++ VAL [X=200, Y=1, counter=64, v=-70, x=64, xy=0, y=0, yx=63] [L31] EXPR counter++ VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=63] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=64] [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, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=65, v=-70, x=64, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=65, v=-68, x=64, xy=0, y=0, yx=64] [L45] x++ VAL [X=200, Y=1, counter=65, v=-68, x=65, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=64] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=65] [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, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=65] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=66, v=-68, x=65, xy=0, y=0, yx=65] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=66, v=-66, x=65, xy=0, y=0, yx=65] [L45] x++ VAL [X=200, Y=1, counter=66, v=-66, x=66, xy=0, y=0, yx=65] [L31] EXPR counter++ VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=65] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=66] [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, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=67, v=-66, x=66, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=67, v=-64, x=66, xy=0, y=0, yx=66] [L45] x++ VAL [X=200, Y=1, counter=67, v=-64, x=67, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=66] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=67] [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, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=67] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=68, v=-64, x=67, xy=0, y=0, yx=67] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=68, v=-62, x=67, xy=0, y=0, yx=67] [L45] x++ VAL [X=200, Y=1, counter=68, v=-62, x=68, xy=0, y=0, yx=67] [L31] EXPR counter++ VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=67] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=68] [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, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=69, v=-62, x=68, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=69, v=-60, x=68, xy=0, y=0, yx=68] [L45] x++ VAL [X=200, Y=1, counter=69, v=-60, x=69, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=68] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=69] [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, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=69] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=70, v=-60, x=69, xy=0, y=0, yx=69] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=70, v=-58, x=69, xy=0, y=0, yx=69] [L45] x++ VAL [X=200, Y=1, counter=70, v=-58, x=70, xy=0, y=0, yx=69] [L31] EXPR counter++ VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=69] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=70] [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, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=71, v=-58, x=70, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=71, v=-56, x=70, xy=0, y=0, yx=70] [L45] x++ VAL [X=200, Y=1, counter=71, v=-56, x=71, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=70] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=71] [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, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=71] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=72, v=-56, x=71, xy=0, y=0, yx=71] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=72, v=-54, x=71, xy=0, y=0, yx=71] [L45] x++ VAL [X=200, Y=1, counter=72, v=-54, x=72, xy=0, y=0, yx=71] [L31] EXPR counter++ VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=71] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=72] [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, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=73, v=-54, x=72, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=73, v=-52, x=72, xy=0, y=0, yx=72] [L45] x++ VAL [X=200, Y=1, counter=73, v=-52, x=73, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=72] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=73] [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, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=73] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=74, v=-52, x=73, xy=0, y=0, yx=73] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=74, v=-50, x=73, xy=0, y=0, yx=73] [L45] x++ VAL [X=200, Y=1, counter=74, v=-50, x=74, xy=0, y=0, yx=73] [L31] EXPR counter++ VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=73] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=74] [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, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=75, v=-50, x=74, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=75, v=-48, x=74, xy=0, y=0, yx=74] [L45] x++ VAL [X=200, Y=1, counter=75, v=-48, x=75, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=74] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=75] [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, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=75] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=76, v=-48, x=75, xy=0, y=0, yx=75] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=76, v=-46, x=75, xy=0, y=0, yx=75] [L45] x++ VAL [X=200, Y=1, counter=76, v=-46, x=76, xy=0, y=0, yx=75] [L31] EXPR counter++ VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=75] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=76] [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, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=77, v=-46, x=76, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=77, v=-44, x=76, xy=0, y=0, yx=76] [L45] x++ VAL [X=200, Y=1, counter=77, v=-44, x=77, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=76] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=77] [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, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=77] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=78, v=-44, x=77, xy=0, y=0, yx=77] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=78, v=-42, x=77, xy=0, y=0, yx=77] [L45] x++ VAL [X=200, Y=1, counter=78, v=-42, x=78, xy=0, y=0, yx=77] [L31] EXPR counter++ VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=77] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=78] [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, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=79, v=-42, x=78, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=79, v=-40, x=78, xy=0, y=0, yx=78] [L45] x++ VAL [X=200, Y=1, counter=79, v=-40, x=79, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=78] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=79] [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, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=79] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=80, v=-40, x=79, xy=0, y=0, yx=79] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=80, v=-38, x=79, xy=0, y=0, yx=79] [L45] x++ VAL [X=200, Y=1, counter=80, v=-38, x=80, xy=0, y=0, yx=79] [L31] EXPR counter++ VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=79] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=80] [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, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=81, v=-38, x=80, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=81, v=-36, x=80, xy=0, y=0, yx=80] [L45] x++ VAL [X=200, Y=1, counter=81, v=-36, x=81, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=80] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=81] [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, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=81] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=82, v=-36, x=81, xy=0, y=0, yx=81] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=82, v=-34, x=81, xy=0, y=0, yx=81] [L45] x++ VAL [X=200, Y=1, counter=82, v=-34, x=82, xy=0, y=0, yx=81] [L31] EXPR counter++ VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=81] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=82] [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, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=83, v=-34, x=82, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=83, v=-32, x=82, xy=0, y=0, yx=82] [L45] x++ VAL [X=200, Y=1, counter=83, v=-32, x=83, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=82] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=83] [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, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=83] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=84, v=-32, x=83, xy=0, y=0, yx=83] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=84, v=-30, x=83, xy=0, y=0, yx=83] [L45] x++ VAL [X=200, Y=1, counter=84, v=-30, x=84, xy=0, y=0, yx=83] [L31] EXPR counter++ VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=83] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=84] [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, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=85, v=-30, x=84, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=85, v=-28, x=84, xy=0, y=0, yx=84] [L45] x++ VAL [X=200, Y=1, counter=85, v=-28, x=85, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=84] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=85] [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, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=85] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=86, v=-28, x=85, xy=0, y=0, yx=85] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=86, v=-26, x=85, xy=0, y=0, yx=85] [L45] x++ VAL [X=200, Y=1, counter=86, v=-26, x=86, xy=0, y=0, yx=85] [L31] EXPR counter++ VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=85] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=86] [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, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=87, v=-26, x=86, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=87, v=-24, x=86, xy=0, y=0, yx=86] [L45] x++ VAL [X=200, Y=1, counter=87, v=-24, x=87, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=86] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=87] [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, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=87] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=88, v=-24, x=87, xy=0, y=0, yx=87] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=88, v=-22, x=87, xy=0, y=0, yx=87] [L45] x++ VAL [X=200, Y=1, counter=88, v=-22, x=88, xy=0, y=0, yx=87] [L31] EXPR counter++ VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=87] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=88] [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, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=89, v=-22, x=88, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=89, v=-20, x=88, xy=0, y=0, yx=88] [L45] x++ VAL [X=200, Y=1, counter=89, v=-20, x=89, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=88] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=89] [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, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=89] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=90, v=-20, x=89, xy=0, y=0, yx=89] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=90, v=-18, x=89, xy=0, y=0, yx=89] [L45] x++ VAL [X=200, Y=1, counter=90, v=-18, x=90, xy=0, y=0, yx=89] [L31] EXPR counter++ VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=89] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=90] [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, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=91, v=-18, x=90, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=91, v=-16, x=90, xy=0, y=0, yx=90] [L45] x++ VAL [X=200, Y=1, counter=91, v=-16, x=91, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=90] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=91] [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, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=91] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=92, v=-16, x=91, xy=0, y=0, yx=91] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=92, v=-14, x=91, xy=0, y=0, yx=91] [L45] x++ VAL [X=200, Y=1, counter=92, v=-14, x=92, xy=0, y=0, yx=91] [L31] EXPR counter++ VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=91] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=92] [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, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=93, v=-14, x=92, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=93, v=-12, x=92, xy=0, y=0, yx=92] [L45] x++ VAL [X=200, Y=1, counter=93, v=-12, x=93, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=92] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=93] [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, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=93] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=94, v=-12, x=93, xy=0, y=0, yx=93] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=94, v=-10, x=93, xy=0, y=0, yx=93] [L45] x++ VAL [X=200, Y=1, counter=94, v=-10, x=94, xy=0, y=0, yx=93] [L31] EXPR counter++ VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=93] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=94] [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, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=95, v=-10, x=94, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=95, v=-8, x=94, xy=0, y=0, yx=94] [L45] x++ VAL [X=200, Y=1, counter=95, v=-8, x=95, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=94] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=95] [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, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=95] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=96, v=-8, x=95, xy=0, y=0, yx=95] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=96, v=-6, x=95, xy=0, y=0, yx=95] [L45] x++ VAL [X=200, Y=1, counter=96, v=-6, x=96, xy=0, y=0, yx=95] [L31] EXPR counter++ VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=95] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=96] [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, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=97, v=-6, x=96, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=97, v=-4, x=96, xy=0, y=0, yx=96] [L45] x++ VAL [X=200, Y=1, counter=97, v=-4, x=97, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=96] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=97] [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, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=97] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=98, v=-4, x=97, xy=0, y=0, yx=97] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=98, v=-2, x=97, xy=0, y=0, yx=97] [L45] x++ VAL [X=200, Y=1, counter=98, v=-2, x=98, xy=0, y=0, yx=97] [L31] EXPR counter++ VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=97] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=98] [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, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=99, v=-2, x=98, xy=0, y=0, yx=98] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=200, Y=1, counter=99, v=0, x=98, xy=0, y=0, yx=98] [L45] x++ VAL [X=200, Y=1, counter=99, v=0, x=99, xy=0, y=0, yx=98] [L31] EXPR counter++ VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=98] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=99] [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, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=99] [L35] COND FALSE !(!(x <= X)) VAL [X=200, Y=1, counter=100, v=0, x=99, xy=0, y=0, yx=99] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=200, Y=1, counter=100, v=-398, x=99, xy=0, y=1, yx=99] [L45] x++ VAL [X=200, Y=1, counter=100, v=-398, x=100, xy=0, y=1, yx=99] [L31] EXPR counter++ VAL [X=200, Y=1, counter=101, v=-398, x=100, xy=0, y=1, yx=99] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=200, Y=1, counter=101, v=-398, xy=100, y=1, yx=100] [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, counter=101] [L16] reach_error() VAL [\old(cond)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.0s, OverallIterations: 14, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1806 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1804 mSDsluCounter, 2471 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2277 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1737 IncrementalHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 194 mSDtfsCounter, 1737 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2889 GetRequests, 2302 SyntacticMatches, 12 SemanticMatches, 575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12039 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2199occurred in iteration=13, InterpolantAutomatonStates: 568, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 4741 NumberOfCodeBlocks, 4642 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 3624 ConstructedInterpolants, 2 QuantifiedInterpolants, 10217 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2867 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 14298/54297 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-24 01:11:18,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7a2606b-95d1-43d7-a1a2-e135c1fb10ba/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE