./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/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_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd --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-826ab2b [2024-11-13 14:13:56,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:13:56,561 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:13:56,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:13:56,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:13:56,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:13:56,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:13:56,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:13:56,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:13:56,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:13:56,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:13:56,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:13:56,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:13:56,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:13:56,592 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:13:56,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:13:56,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:13:56,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:13:56,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:13:56,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:13:56,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:13:56,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:13:56,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:13:56,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:13:56,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:13:56,597 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:13:56,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:13:56,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:13:56,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:13:56,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:13:56,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:13:56,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:13:56,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:13:56,600 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_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd 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-13 14:13:56,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:13:56,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:13:56,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:13:56,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:13:56,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:13:56,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c Unable to find full path for "g++" [2024-11-13 14:13:58,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:13:59,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:13:59,165 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-11-13 14:13:59,172 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/data/cda94dbfe/ba6c75c985da4cd2852ef592d5b42999/FLAG041cc8ff0 [2024-11-13 14:13:59,195 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/data/cda94dbfe/ba6c75c985da4cd2852ef592d5b42999 [2024-11-13 14:13:59,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:13:59,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:13:59,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:13:59,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:13:59,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:13:59,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3207bcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59, skipping insertion in model container [2024-11-13 14:13:59,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:13:59,395 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_f6a0395f-caac-429e-a600-8d9a03710cdd/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-11-13 14:13:59,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:13:59,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:13:59,436 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_f6a0395f-caac-429e-a600-8d9a03710cdd/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-11-13 14:13:59,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:13:59,465 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:13:59,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59 WrapperNode [2024-11-13 14:13:59,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:13:59,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:13:59,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:13:59,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:13:59,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,497 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-13 14:13:59,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:13:59,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:13:59,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:13:59,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:13:59,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,528 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-13 14:13:59,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:13:59,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:13:59,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:13:59,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:13:59,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (1/1) ... [2024-11-13 14:13:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:13:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:59,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:13:59,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:13:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:13:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:13:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:13:59,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:13:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 14:13:59,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 14:13:59,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:13:59,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:13:59,878 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-13 14:13:59,878 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:13:59,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:13:59,894 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:13:59,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:13:59 BoogieIcfgContainer [2024-11-13 14:13:59,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:13:59,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:13:59,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:13:59,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:13:59,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:13:59" (1/3) ... [2024-11-13 14:13:59,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f3a9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:13:59, skipping insertion in model container [2024-11-13 14:13:59,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:59" (2/3) ... [2024-11-13 14:13:59,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f3a9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:13:59, skipping insertion in model container [2024-11-13 14:13:59,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:13:59" (3/3) ... [2024-11-13 14:13:59,908 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2024-11-13 14:13:59,927 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:13:59,931 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound100.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:14:00,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:14:00,017 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;@372d68d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:14:00,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:14:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:14:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 14:14:00,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:00,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:00,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:00,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash 150860991, now seen corresponding path program 1 times [2024-11-13 14:14:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313339234] [2024-11-13 14:14:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:14:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70196529] [2024-11-13 14:14:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:00,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:00,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:00,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:00,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:14:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:00,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:14:00,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:00,444 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-13 14:14:00,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:14:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313339234] [2024-11-13 14:14:00,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:14:00,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70196529] [2024-11-13 14:14:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70196529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:14:00,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:14:00,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:14:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671881836] [2024-11-13 14:14:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:14:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:14:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:14:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:14:00,474 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:14:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:00,617 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-13 14:14:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:14:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 14:14:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:00,630 INFO L225 Difference]: With dead ends: 52 [2024-11-13 14:14:00,630 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 14:14:00,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:14:00,636 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:00,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:14:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 14:14:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-11-13 14:14:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:14:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-13 14:14:00,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2024-11-13 14:14:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:00,675 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-13 14:14:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:14:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-13 14:14:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:14:00,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:00,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:00,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:14:00,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-13 14:14:00,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 309149643, now seen corresponding path program 1 times [2024-11-13 14:14:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278385272] [2024-11-13 14:14:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:01,039 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-13 14:14:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:01,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278385272] [2024-11-13 14:14:01,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278385272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:14:01,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:14:01,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:14:01,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106679404] [2024-11-13 14:14:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:14:01,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:14:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:01,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:14:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:14:01,045 INFO L87 Difference]: Start difference. First operand 23 states and 27 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-13 14:14:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:01,073 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-13 14:14:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:14:01,074 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-13 14:14:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:01,076 INFO L225 Difference]: With dead ends: 31 [2024-11-13 14:14:01,076 INFO L226 Difference]: Without dead ends: 23 [2024-11-13 14:14:01,076 INFO L431 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-13 14:14:01,079 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-13 14:14:01,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:14:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-13 14:14:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-13 14:14:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 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-13 14:14:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-13 14:14:01,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-11-13 14:14:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:01,092 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-13 14:14:01,092 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-13 14:14:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-13 14:14:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 14:14:01,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:01,093 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:01,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:14:01,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:01,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -109323119, now seen corresponding path program 1 times [2024-11-13 14:14:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832207772] [2024-11-13 14:14:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:14:01,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510851638] [2024-11-13 14:14:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:01,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:01,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:01,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:14:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:01,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:14:01,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:01,407 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-13 14:14:01,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:14:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832207772] [2024-11-13 14:14:01,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:14:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510851638] [2024-11-13 14:14:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510851638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:14:01,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:14:01,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:14:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477385464] [2024-11-13 14:14:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:14:01,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:14:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:14:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:14:01,410 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 14:14:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:01,521 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-13 14:14:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:14:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2024-11-13 14:14:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:01,522 INFO L225 Difference]: With dead ends: 33 [2024-11-13 14:14:01,522 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 14:14:01,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-13 14:14:01,524 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 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-13 14:14:01,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:14:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 14:14:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-13 14:14:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:14:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-13 14:14:01,530 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2024-11-13 14:14:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:01,530 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-13 14:14:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 14:14:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-13 14:14:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 14:14:01,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:01,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:01,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:14:01,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:01,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:01,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:01,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1400513534, now seen corresponding path program 1 times [2024-11-13 14:14:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:01,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528252582] [2024-11-13 14:14:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:14:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441105174] [2024-11-13 14:14:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:01,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:01,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:01,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:01,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:14:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:01,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:14:01,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:14:02,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 14:14:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528252582] [2024-11-13 14:14:02,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:14:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441105174] [2024-11-13 14:14:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441105174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:02,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:14:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-13 14:14:02,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045254484] [2024-11-13 14:14:02,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:14:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:14:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:14:02,225 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-13 14:14:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:02,528 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-13 14:14:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:14:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 18 [2024-11-13 14:14:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:02,530 INFO L225 Difference]: With dead ends: 41 [2024-11-13 14:14:02,530 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 14:14:02,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 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-13 14:14:02,531 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:02,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:14:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 14:14:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-11-13 14:14:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-13 14:14:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-13 14:14:02,540 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2024-11-13 14:14:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:02,540 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-13 14:14:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-13 14:14:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-13 14:14:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:14:02,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:02,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:02,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:14:02,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:02,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -538820376, now seen corresponding path program 1 times [2024-11-13 14:14:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544717816] [2024-11-13 14:14:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:02,959 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-13 14:14:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544717816] [2024-11-13 14:14:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544717816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056771710] [2024-11-13 14:14:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:02,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:02,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:02,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:02,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:14:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:03,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:14:03,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:03,069 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-13 14:14:03,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:03,139 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-13 14:14:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056771710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:03,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-13 14:14:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915816897] [2024-11-13 14:14:03,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:03,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:14:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:14:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:14:03,145 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (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-13 14:14:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:03,233 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-13 14:14:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:14:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (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 19 [2024-11-13 14:14:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:03,238 INFO L225 Difference]: With dead ends: 68 [2024-11-13 14:14:03,238 INFO L226 Difference]: Without dead ends: 62 [2024-11-13 14:14:03,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 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-13 14:14:03,239 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:03,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:14:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-13 14:14:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-13 14:14:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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-13 14:14:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-13 14:14:03,261 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2024-11-13 14:14:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:03,261 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-13 14:14:03,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (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-13 14:14:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-13 14:14:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:14:03,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:03,263 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:03,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:14:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:03,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -8334354, now seen corresponding path program 1 times [2024-11-13 14:14:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103992825] [2024-11-13 14:14:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:14:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643248027] [2024-11-13 14:14:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:03,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:03,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:03,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:03,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:14:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:03,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:14:03,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:14:03,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:14:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103992825] [2024-11-13 14:14:04,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:14:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643248027] [2024-11-13 14:14:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643248027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:04,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:14:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-13 14:14:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044050601] [2024-11-13 14:14:04,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:04,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:14:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:14:04,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:14:04,017 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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-13 14:14:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:04,369 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-13 14:14:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:14:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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 25 [2024-11-13 14:14:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:04,373 INFO L225 Difference]: With dead ends: 79 [2024-11-13 14:14:04,373 INFO L226 Difference]: Without dead ends: 73 [2024-11-13 14:14:04,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 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-13 14:14:04,374 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:04,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:14:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-13 14:14:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-13 14:14:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 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-13 14:14:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-13 14:14:04,407 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2024-11-13 14:14:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:04,407 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-13 14:14:04,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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-13 14:14:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-13 14:14:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:14:04,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:04,410 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:04,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 14:14:04,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:04,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:04,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1288198032, now seen corresponding path program 1 times [2024-11-13 14:14:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103718770] [2024-11-13 14:14:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:14:04,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143636442] [2024-11-13 14:14:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:04,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:04,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:04,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:04,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:14:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:04,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 14:14:04,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:14:05,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:14:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103718770] [2024-11-13 14:14:10,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:14:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143636442] [2024-11-13 14:14:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143636442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:10,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:14:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-13 14:14:10,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26286463] [2024-11-13 14:14:10,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:10,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 14:14:10,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:10,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 14:14:10,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:14:10,965 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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-13 14:14:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:14,651 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-13 14:14:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 14:14:14,653 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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 25 [2024-11-13 14:14:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:14,654 INFO L225 Difference]: With dead ends: 86 [2024-11-13 14:14:14,654 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 14:14:14,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 14:14:14,656 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:14,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:14:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 14:14:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-13 14:14:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:14:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-13 14:14:14,675 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2024-11-13 14:14:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:14,675 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-13 14:14:14,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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-13 14:14:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-11-13 14:14:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:14:14,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:14,677 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:14,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:14:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 14:14:14,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:14,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1010249843, now seen corresponding path program 1 times [2024-11-13 14:14:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:14,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280209111] [2024-11-13 14:14:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:14,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:14:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280209111] [2024-11-13 14:14:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280209111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073345782] [2024-11-13 14:14:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:15,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:15,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:15,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:14:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:15,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:14:15,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:14:15,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:14:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073345782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:15,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-13 14:14:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400368935] [2024-11-13 14:14:15,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:15,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:14:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:15,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:14:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:14:15,439 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:14:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:15,642 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-13 14:14:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:14:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-11-13 14:14:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:15,644 INFO L225 Difference]: With dead ends: 88 [2024-11-13 14:14:15,644 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 14:14:15,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:14:15,645 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:15,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:14:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 14:14:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-13 14:14:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 14:14:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-13 14:14:15,674 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2024-11-13 14:14:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:15,675 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-13 14:14:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:14:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-13 14:14:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 14:14:15,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:15,676 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:15,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:14:15,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 14:14:15,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:15,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -935496086, now seen corresponding path program 2 times [2024-11-13 14:14:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883319587] [2024-11-13 14:14:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 14:14:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883319587] [2024-11-13 14:14:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883319587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96343505] [2024-11-13 14:14:16,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:14:16,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:16,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:16,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:16,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:14:16,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:14:16,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:14:16,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:14:16,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 14:14:16,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 14:14:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96343505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:16,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-13 14:14:16,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904950113] [2024-11-13 14:14:16,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:14:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:16,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:14:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:14:16,637 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:14:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:17,129 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-11-13 14:14:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:14:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2024-11-13 14:14:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:17,131 INFO L225 Difference]: With dead ends: 110 [2024-11-13 14:14:17,131 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 14:14:17,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-13 14:14:17,132 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:17,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:14:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 14:14:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-13 14:14:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:14:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-11-13 14:14:17,156 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 45 [2024-11-13 14:14:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:17,156 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-13 14:14:17,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:14:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-11-13 14:14:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 14:14:17,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:17,158 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:17,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 14:14:17,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 14:14:17,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:17,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash -499637910, now seen corresponding path program 3 times [2024-11-13 14:14:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261723985] [2024-11-13 14:14:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 14:14:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261723985] [2024-11-13 14:14:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261723985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931929323] [2024-11-13 14:14:17,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:14:17,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:17,526 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:17,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:14:17,666 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 14:14:17,667 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:14:17,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:14:17,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 14:14:18,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 14:14:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931929323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:29,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:29,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 12] total 26 [2024-11-13 14:14:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411696519] [2024-11-13 14:14:29,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:29,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 14:14:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 14:14:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=557, Unknown=2, NotChecked=0, Total=650 [2024-11-13 14:14:29,292 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:14:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:36,760 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2024-11-13 14:14:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 14:14:36,761 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 45 [2024-11-13 14:14:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:36,762 INFO L225 Difference]: With dead ends: 157 [2024-11-13 14:14:36,763 INFO L226 Difference]: Without dead ends: 132 [2024-11-13 14:14:36,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=373, Invalid=1787, Unknown=2, NotChecked=0, Total=2162 [2024-11-13 14:14:36,765 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:36,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 213 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 14:14:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-13 14:14:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 62. [2024-11-13 14:14:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:14:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-11-13 14:14:36,809 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2024-11-13 14:14:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:36,809 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-11-13 14:14:36,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:14:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-13 14:14:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:14:36,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:36,812 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:36,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:14:37,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:37,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1120699071, now seen corresponding path program 2 times [2024-11-13 14:14:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158707658] [2024-11-13 14:14:37,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:37,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 14:14:37,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:37,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158707658] [2024-11-13 14:14:37,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158707658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:37,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150416881] [2024-11-13 14:14:37,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:14:37,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:37,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:37,183 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:37,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:14:37,260 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:14:37,260 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:14:37,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:14:37,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:14:37,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 14:14:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150416881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:37,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-13 14:14:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695099681] [2024-11-13 14:14:37,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:14:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:14:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:14:37,475 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (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-13 14:14:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:37,680 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-13 14:14:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 14:14:37,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (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 49 [2024-11-13 14:14:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:37,682 INFO L225 Difference]: With dead ends: 128 [2024-11-13 14:14:37,682 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 14:14:37,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:14:37,683 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:37,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:14:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 14:14:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-13 14:14:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 98 states have internal predecessors, (110), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:14:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-13 14:14:37,725 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 49 [2024-11-13 14:14:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:37,725 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-13 14:14:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (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-13 14:14:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-13 14:14:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:14:37,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:37,729 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:37,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 14:14:37,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:37,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1761853357, now seen corresponding path program 3 times [2024-11-13 14:14:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:37,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209406641] [2024-11-13 14:14:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:14:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:14:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 14:14:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:14:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:14:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:14:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 14:14:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209406641] [2024-11-13 14:14:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209406641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589916220] [2024-11-13 14:14:38,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:14:38,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:38,678 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:38,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:14:38,739 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 14:14:38,739 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:14:38,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:14:38,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-13 14:14:39,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-13 14:14:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589916220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:39,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 29 [2024-11-13 14:14:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680092177] [2024-11-13 14:14:39,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:39,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 14:14:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 14:14:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:14:39,637 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 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-13 14:14:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:42,634 INFO L93 Difference]: Finished difference Result 239 states and 263 transitions. [2024-11-13 14:14:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-13 14:14:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 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 109 [2024-11-13 14:14:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:42,638 INFO L225 Difference]: With dead ends: 239 [2024-11-13 14:14:42,638 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 14:14:42,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4788 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1964, Invalid=12556, Unknown=0, NotChecked=0, Total=14520 [2024-11-13 14:14:42,641 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 246 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:42,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 101 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:14:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 14:14:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-13 14:14:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 181 states have internal predecessors, (203), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 14:14:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2024-11-13 14:14:42,717 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 109 [2024-11-13 14:14:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:42,718 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2024-11-13 14:14:42,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 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-13 14:14:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2024-11-13 14:14:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:14:42,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:42,721 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:42,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:14:42,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:42,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2112574388, now seen corresponding path program 1 times [2024-11-13 14:14:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870272051] [2024-11-13 14:14:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:14:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:14:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 14:14:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:14:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:14:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:14:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:14:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:14:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870272051] [2024-11-13 14:14:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870272051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703023795] [2024-11-13 14:14:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:43,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:43,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:43,611 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:43,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:14:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:43,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 14:14:43,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:14:43,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:14:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703023795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:44,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:44,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-11-13 14:14:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591574323] [2024-11-13 14:14:44,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:44,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 14:14:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:44,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 14:14:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:14:44,351 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 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-13 14:14:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:45,007 INFO L93 Difference]: Finished difference Result 495 states and 555 transitions. [2024-11-13 14:14:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 14:14:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 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 119 [2024-11-13 14:14:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:45,012 INFO L225 Difference]: With dead ends: 495 [2024-11-13 14:14:45,012 INFO L226 Difference]: Without dead ends: 489 [2024-11-13 14:14:45,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-11-13 14:14:45,014 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:45,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 254 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:14:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-13 14:14:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2024-11-13 14:14:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 389 states have (on average 1.1233933161953729) internal successors, (437), 389 states have internal predecessors, (437), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:14:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 534 transitions. [2024-11-13 14:14:45,163 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 534 transitions. Word has length 119 [2024-11-13 14:14:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:45,163 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 534 transitions. [2024-11-13 14:14:45,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 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-13 14:14:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 534 transitions. [2024-11-13 14:14:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 14:14:45,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:45,168 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:45,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:14:45,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 14:14:45,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash -621644923, now seen corresponding path program 2 times [2024-11-13 14:14:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848494391] [2024-11-13 14:14:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:14:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:14:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 14:14:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:14:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:14:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:14:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:14:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:14:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 14:14:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:14:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-13 14:14:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 14:14:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 14:14:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 14:14:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:14:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-13 14:14:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 14:14:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-13 14:14:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 14:14:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 14:14:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-13 14:14:47,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848494391] [2024-11-13 14:14:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848494391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778278855] [2024-11-13 14:14:47,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:14:47,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:47,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:47,276 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:47,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:14:47,469 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:14:47,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:14:47,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 14:14:47,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:14:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:14:47,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:14:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-13 14:14:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778278855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:14:49,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:14:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 28] total 54 [2024-11-13 14:14:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484837359] [2024-11-13 14:14:49,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:14:49,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 14:14:49,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:14:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 14:14:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 14:14:49,457 INFO L87 Difference]: Start difference. First operand 486 states and 534 transitions. Second operand has 54 states, 54 states have (on average 6.055555555555555) internal successors, (327), 54 states have internal predecessors, (327), 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-13 14:14:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:14:52,091 INFO L93 Difference]: Finished difference Result 1015 states and 1140 transitions. [2024-11-13 14:14:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-13 14:14:52,092 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.055555555555555) internal successors, (327), 54 states have internal predecessors, (327), 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 249 [2024-11-13 14:14:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:14:52,099 INFO L225 Difference]: With dead ends: 1015 [2024-11-13 14:14:52,099 INFO L226 Difference]: Without dead ends: 1009 [2024-11-13 14:14:52,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-11-13 14:14:52,103 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 345 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:14:52,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 407 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:14:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-13 14:14:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2024-11-13 14:14:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 805 states have (on average 1.124223602484472) internal successors, (905), 805 states have internal predecessors, (905), 101 states have call successors, (101), 100 states have call predecessors, (101), 99 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:14:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1106 transitions. [2024-11-13 14:14:52,391 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1106 transitions. Word has length 249 [2024-11-13 14:14:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:14:52,391 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1106 transitions. [2024-11-13 14:14:52,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.055555555555555) internal successors, (327), 54 states have internal predecessors, (327), 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-13 14:14:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1106 transitions. [2024-11-13 14:14:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-11-13 14:14:52,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:14:52,406 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:14:52,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:14:52,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:52,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:14:52,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:14:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1995383607, now seen corresponding path program 3 times [2024-11-13 14:14:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:14:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197911009] [2024-11-13 14:14:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:14:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:14:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:14:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 14:14:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:14:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:14:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:14:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 14:14:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:14:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:14:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:14:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:14:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:14:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 14:14:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:14:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-13 14:14:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 14:14:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 14:14:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 14:14:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:14:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-13 14:14:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 14:14:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-13 14:14:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 14:14:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 14:14:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-13 14:14:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 14:14:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-13 14:14:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-13 14:14:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-13 14:14:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-13 14:14:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-11-13 14:14:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-13 14:14:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-13 14:14:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-11-13 14:14:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-13 14:14:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-13 14:14:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-13 14:14:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-13 14:14:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-13 14:14:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2024-11-13 14:14:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-11-13 14:14:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-13 14:14:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-13 14:14:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2024-11-13 14:14:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2024-11-13 14:14:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 454 [2024-11-13 14:14:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2024-11-13 14:14:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2024-11-13 14:14:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2024-11-13 14:14:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 494 [2024-11-13 14:14:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 7450 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-13 14:14:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:14:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197911009] [2024-11-13 14:14:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197911009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468482781] [2024-11-13 14:14:59,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:14:59,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:59,132 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:59,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:14:59,746 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-13 14:14:59,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:14:59,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-13 14:14:59,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:15:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 12350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:15:00,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:15:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 7450 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-13 14:15:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468482781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:15:04,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:15:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 54] total 104 [2024-11-13 14:15:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41440692] [2024-11-13 14:15:04,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:15:04,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-11-13 14:15:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:15:04,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-11-13 14:15:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2024-11-13 14:15:04,723 INFO L87 Difference]: Start difference. First operand 1006 states and 1106 transitions. Second operand has 104 states, 104 states have (on average 6.355769230769231) internal successors, (661), 104 states have internal predecessors, (661), 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-13 14:15:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:15:12,370 INFO L93 Difference]: Finished difference Result 2015 states and 2264 transitions. [2024-11-13 14:15:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-11-13 14:15:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.355769230769231) internal successors, (661), 104 states have internal predecessors, (661), 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 509 [2024-11-13 14:15:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:15:12,381 INFO L225 Difference]: With dead ends: 2015 [2024-11-13 14:15:12,381 INFO L226 Difference]: Without dead ends: 2009 [2024-11-13 14:15:12,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1268 GetRequests, 1065 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6227 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15305, Invalid=25701, Unknown=0, NotChecked=0, Total=41006 [2024-11-13 14:15:12,392 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 787 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:15:12,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 786 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:15:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-11-13 14:15:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2006. [2024-11-13 14:15:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1605 states have (on average 1.1246105919003115) internal successors, (1805), 1605 states have internal predecessors, (1805), 201 states have call successors, (201), 200 states have call predecessors, (201), 199 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-13 14:15:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2206 transitions. [2024-11-13 14:15:12,797 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2206 transitions. Word has length 509 [2024-11-13 14:15:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:15:12,798 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 2206 transitions. [2024-11-13 14:15:12,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.355769230769231) internal successors, (661), 104 states have internal predecessors, (661), 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-13 14:15:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2206 transitions. [2024-11-13 14:15:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2024-11-13 14:15:12,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:15:12,834 INFO L215 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:15:12,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 14:15:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 14:15:13,035 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:15:13,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:15:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1858271137, now seen corresponding path program 4 times [2024-11-13 14:15:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:15:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610855081] [2024-11-13 14:15:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:15:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:15:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:15:14,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451812045] [2024-11-13 14:15:14,141 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:15:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:15:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:15:14,144 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:15:14,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:15:14,777 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:15:14,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 14:15:14,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:15:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:15:16,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:15:16,411 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:15:16,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:15:16,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 14:15:16,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 14:15:16,616 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-13 14:15:16,959 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:15:16,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:15:16 BoogieIcfgContainer [2024-11-13 14:15:16,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:15:16,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:15:16,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:15:16,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:15:16,965 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:13:59" (3/4) ... [2024-11-13 14:15:16,965 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 14:15:17,280 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:15:17,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:15:17,281 INFO L158 Benchmark]: Toolchain (without parser) took 78082.30ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 117.7MB in the beginning and 500.2MB in the end (delta: -382.4MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. [2024-11-13 14:15:17,281 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:15:17,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.20ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 106.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:15:17,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.74ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 105.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:15:17,282 INFO L158 Benchmark]: Boogie Preprocessor took 39.78ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 104.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:15:17,283 INFO L158 Benchmark]: RCFGBuilder took 355.93ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 93.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:15:17,283 INFO L158 Benchmark]: TraceAbstraction took 77065.98ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 92.7MB in the beginning and 537.9MB in the end (delta: -445.2MB). Peak memory consumption was 313.2MB. Max. memory is 16.1GB. [2024-11-13 14:15:17,284 INFO L158 Benchmark]: Witness Printer took 316.11ms. Allocated memory is still 662.7MB. Free memory was 537.9MB in the beginning and 500.2MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-13 14:15:17,288 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.38ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.20ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 106.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.74ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 105.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.78ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 104.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 355.93ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 93.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 77065.98ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 92.7MB in the beginning and 537.9MB in the end (delta: -445.2MB). Peak memory consumption was 313.2MB. Max. memory is 16.1GB. * Witness Printer took 316.11ms. Allocated memory is still 662.7MB. Free memory was 537.9MB in the beginning and 500.2MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. 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=199, Y=1, counter=0, v=-197, x=0, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=1, v=-197, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=1, v=-197, 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=199, Y=1, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=1, v=-195, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=199, Y=1, counter=1, v=-195, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=199, Y=1, counter=2, v=-195, 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=199, Y=1, counter=2, v=-195, 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=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=2, v=-193, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=199, Y=1, counter=2, v=-193, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=199, Y=1, counter=3, v=-193, 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=199, Y=1, counter=3, v=-193, 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=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=3, v=-191, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=199, Y=1, counter=3, v=-191, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=199, Y=1, counter=4, v=-191, 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=199, Y=1, counter=4, v=-191, 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=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=4, v=-189, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=199, Y=1, counter=4, v=-189, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=199, Y=1, counter=5, v=-189, 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=199, Y=1, counter=5, v=-189, 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=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=5, v=-187, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=199, Y=1, counter=5, v=-187, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=199, Y=1, counter=6, v=-187, 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=199, Y=1, counter=6, v=-187, 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=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=6, v=-185, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=199, Y=1, counter=6, v=-185, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=199, Y=1, counter=7, v=-185, 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=199, Y=1, counter=7, v=-185, 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=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=7, v=-183, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=199, Y=1, counter=7, v=-183, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=199, Y=1, counter=8, v=-183, 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=199, Y=1, counter=8, v=-183, 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=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=8, v=-181, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=199, Y=1, counter=8, v=-181, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=199, Y=1, counter=9, v=-181, 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=199, Y=1, counter=9, v=-181, 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=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=9, v=-179, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=199, Y=1, counter=9, v=-179, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=199, Y=1, counter=10, v=-179, 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=199, Y=1, counter=10, v=-179, 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=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=10, v=-177, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=199, Y=1, counter=10, v=-177, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=199, Y=1, counter=11, v=-177, 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=199, Y=1, counter=11, v=-177, 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=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=11, v=-175, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=199, Y=1, counter=11, v=-175, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=199, Y=1, counter=12, v=-175, 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=199, Y=1, counter=12, v=-175, 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=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=12, v=-173, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=199, Y=1, counter=12, v=-173, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=199, Y=1, counter=13, v=-173, 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=199, Y=1, counter=13, v=-173, 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=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=13, v=-171, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=199, Y=1, counter=13, v=-171, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=199, Y=1, counter=14, v=-171, 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=199, Y=1, counter=14, v=-171, 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=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=14, v=-169, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=199, Y=1, counter=14, v=-169, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=199, Y=1, counter=15, v=-169, 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=199, Y=1, counter=15, v=-169, 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=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=15, v=-167, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=199, Y=1, counter=15, v=-167, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=199, Y=1, counter=16, v=-167, 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=199, Y=1, counter=16, v=-167, 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=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=16, v=-165, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=199, Y=1, counter=16, v=-165, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=199, Y=1, counter=17, v=-165, 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=199, Y=1, counter=17, v=-165, 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=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=17, v=-163, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=199, Y=1, counter=17, v=-163, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=199, Y=1, counter=18, v=-163, 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=199, Y=1, counter=18, v=-163, 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=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=18, v=-161, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=199, Y=1, counter=18, v=-161, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=199, Y=1, counter=19, v=-161, 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=199, Y=1, counter=19, v=-161, 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=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=19, v=-159, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=199, Y=1, counter=19, v=-159, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=199, Y=1, counter=20, v=-159, 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=199, Y=1, counter=20, v=-159, 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=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=20, v=-157, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=199, Y=1, counter=20, v=-157, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=199, Y=1, counter=21, v=-157, 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=199, Y=1, counter=21, v=-157, 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=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=21, v=-155, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=199, Y=1, counter=21, v=-155, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=199, Y=1, counter=22, v=-155, 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=199, Y=1, counter=22, v=-155, 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=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=22, v=-153, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=199, Y=1, counter=22, v=-153, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=199, Y=1, counter=23, v=-153, 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=199, Y=1, counter=23, v=-153, 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=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=23, v=-151, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=199, Y=1, counter=23, v=-151, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=199, Y=1, counter=24, v=-151, 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=199, Y=1, counter=24, v=-151, 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=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=24, v=-149, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=199, Y=1, counter=24, v=-149, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=199, Y=1, counter=25, v=-149, 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=199, Y=1, counter=25, v=-149, 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=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=25, v=-147, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=199, Y=1, counter=25, v=-147, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=199, Y=1, counter=26, v=-147, 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=199, Y=1, counter=26, v=-147, 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=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=26, v=-145, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=199, Y=1, counter=26, v=-145, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=199, Y=1, counter=27, v=-145, 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=199, Y=1, counter=27, v=-145, 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=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=27, v=-143, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=199, Y=1, counter=27, v=-143, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=199, Y=1, counter=28, v=-143, 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=199, Y=1, counter=28, v=-143, 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=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=28, v=-141, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=199, Y=1, counter=28, v=-141, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=199, Y=1, counter=29, v=-141, 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=199, Y=1, counter=29, v=-141, 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=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=29, v=-139, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=199, Y=1, counter=29, v=-139, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=199, Y=1, counter=30, v=-139, 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=199, Y=1, counter=30, v=-139, 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=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=30, v=-137, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=199, Y=1, counter=30, v=-137, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=199, Y=1, counter=31, v=-137, 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=199, Y=1, counter=31, v=-137, 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=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=31, v=-135, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=199, Y=1, counter=31, v=-135, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=199, Y=1, counter=32, v=-135, 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=199, Y=1, counter=32, v=-135, 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=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=32, v=-133, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=199, Y=1, counter=32, v=-133, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=199, Y=1, counter=33, v=-133, 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=199, Y=1, counter=33, v=-133, 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=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=33, v=-131, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=199, Y=1, counter=33, v=-131, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=199, Y=1, counter=34, v=-131, 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=199, Y=1, counter=34, v=-131, 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=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=34, v=-129, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=199, Y=1, counter=34, v=-129, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=199, Y=1, counter=35, v=-129, 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=199, Y=1, counter=35, v=-129, 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=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=35, v=-127, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=199, Y=1, counter=35, v=-127, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=199, Y=1, counter=36, v=-127, 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=199, Y=1, counter=36, v=-127, 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=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=36, v=-125, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=199, Y=1, counter=36, v=-125, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=199, Y=1, counter=37, v=-125, 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=199, Y=1, counter=37, v=-125, 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=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=37, v=-123, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=199, Y=1, counter=37, v=-123, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=199, Y=1, counter=38, v=-123, 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=199, Y=1, counter=38, v=-123, 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=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=38, v=-121, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=199, Y=1, counter=38, v=-121, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=199, Y=1, counter=39, v=-121, 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=199, Y=1, counter=39, v=-121, 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=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=39, v=-119, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=199, Y=1, counter=39, v=-119, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=199, Y=1, counter=40, v=-119, 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=199, Y=1, counter=40, v=-119, 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=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=40, v=-117, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=199, Y=1, counter=40, v=-117, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=199, Y=1, counter=41, v=-117, 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=199, Y=1, counter=41, v=-117, 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=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=41, v=-115, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=199, Y=1, counter=41, v=-115, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=199, Y=1, counter=42, v=-115, 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=199, Y=1, counter=42, v=-115, 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=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=42, v=-113, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=199, Y=1, counter=42, v=-113, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=199, Y=1, counter=43, v=-113, 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=199, Y=1, counter=43, v=-113, 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=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=43, v=-111, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=199, Y=1, counter=43, v=-111, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=199, Y=1, counter=44, v=-111, 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=199, Y=1, counter=44, v=-111, 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=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=44, v=-109, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=199, Y=1, counter=44, v=-109, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=199, Y=1, counter=45, v=-109, 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=199, Y=1, counter=45, v=-109, 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=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=45, v=-107, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=199, Y=1, counter=45, v=-107, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=199, Y=1, counter=46, v=-107, 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=199, Y=1, counter=46, v=-107, 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=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=46, v=-105, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=199, Y=1, counter=46, v=-105, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=199, Y=1, counter=47, v=-105, 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=199, Y=1, counter=47, v=-105, 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=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=47, v=-103, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=199, Y=1, counter=47, v=-103, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=199, Y=1, counter=48, v=-103, 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=199, Y=1, counter=48, v=-103, 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=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=48, v=-101, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=199, Y=1, counter=48, v=-101, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=199, Y=1, counter=49, v=-101, 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=199, Y=1, counter=49, v=-101, 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=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=49, v=-99, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=199, Y=1, counter=49, v=-99, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=199, Y=1, counter=50, v=-99, 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=199, Y=1, counter=50, v=-99, 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=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=50, v=-97, x=49, xy=0, y=0, yx=49] [L45] x++ VAL [X=199, Y=1, counter=50, v=-97, x=50, xy=0, y=0, yx=49] [L31] EXPR counter++ VAL [X=199, Y=1, counter=51, v=-97, 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=199, Y=1, counter=51, v=-97, 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=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=51, v=-95, x=50, xy=0, y=0, yx=50] [L45] x++ VAL [X=199, Y=1, counter=51, v=-95, x=51, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=199, Y=1, counter=52, v=-95, 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=199, Y=1, counter=52, v=-95, 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=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=52, v=-93, x=51, xy=0, y=0, yx=51] [L45] x++ VAL [X=199, Y=1, counter=52, v=-93, x=52, xy=0, y=0, yx=51] [L31] EXPR counter++ VAL [X=199, Y=1, counter=53, v=-93, 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=199, Y=1, counter=53, v=-93, 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=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=53, v=-91, x=52, xy=0, y=0, yx=52] [L45] x++ VAL [X=199, Y=1, counter=53, v=-91, x=53, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=199, Y=1, counter=54, v=-91, 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=199, Y=1, counter=54, v=-91, 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=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=54, v=-89, x=53, xy=0, y=0, yx=53] [L45] x++ VAL [X=199, Y=1, counter=54, v=-89, x=54, xy=0, y=0, yx=53] [L31] EXPR counter++ VAL [X=199, Y=1, counter=55, v=-89, 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=199, Y=1, counter=55, v=-89, 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=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=55, v=-87, x=54, xy=0, y=0, yx=54] [L45] x++ VAL [X=199, Y=1, counter=55, v=-87, x=55, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=199, Y=1, counter=56, v=-87, 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=199, Y=1, counter=56, v=-87, 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=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=56, v=-85, x=55, xy=0, y=0, yx=55] [L45] x++ VAL [X=199, Y=1, counter=56, v=-85, x=56, xy=0, y=0, yx=55] [L31] EXPR counter++ VAL [X=199, Y=1, counter=57, v=-85, 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=199, Y=1, counter=57, v=-85, 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=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=57, v=-83, x=56, xy=0, y=0, yx=56] [L45] x++ VAL [X=199, Y=1, counter=57, v=-83, x=57, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=199, Y=1, counter=58, v=-83, 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=199, Y=1, counter=58, v=-83, 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=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=58, v=-81, x=57, xy=0, y=0, yx=57] [L45] x++ VAL [X=199, Y=1, counter=58, v=-81, x=58, xy=0, y=0, yx=57] [L31] EXPR counter++ VAL [X=199, Y=1, counter=59, v=-81, 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=199, Y=1, counter=59, v=-81, 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=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=59, v=-79, x=58, xy=0, y=0, yx=58] [L45] x++ VAL [X=199, Y=1, counter=59, v=-79, x=59, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=199, Y=1, counter=60, v=-79, 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=199, Y=1, counter=60, v=-79, 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=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=60, v=-77, x=59, xy=0, y=0, yx=59] [L45] x++ VAL [X=199, Y=1, counter=60, v=-77, x=60, xy=0, y=0, yx=59] [L31] EXPR counter++ VAL [X=199, Y=1, counter=61, v=-77, 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=199, Y=1, counter=61, v=-77, 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=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=61, v=-75, x=60, xy=0, y=0, yx=60] [L45] x++ VAL [X=199, Y=1, counter=61, v=-75, x=61, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=199, Y=1, counter=62, v=-75, 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=199, Y=1, counter=62, v=-75, 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=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=62, v=-73, x=61, xy=0, y=0, yx=61] [L45] x++ VAL [X=199, Y=1, counter=62, v=-73, x=62, xy=0, y=0, yx=61] [L31] EXPR counter++ VAL [X=199, Y=1, counter=63, v=-73, 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=199, Y=1, counter=63, v=-73, 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=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=63, v=-71, x=62, xy=0, y=0, yx=62] [L45] x++ VAL [X=199, Y=1, counter=63, v=-71, x=63, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=199, Y=1, counter=64, v=-71, 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=199, Y=1, counter=64, v=-71, 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=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=64, v=-69, x=63, xy=0, y=0, yx=63] [L45] x++ VAL [X=199, Y=1, counter=64, v=-69, x=64, xy=0, y=0, yx=63] [L31] EXPR counter++ VAL [X=199, Y=1, counter=65, v=-69, 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=199, Y=1, counter=65, v=-69, 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=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=65, v=-67, x=64, xy=0, y=0, yx=64] [L45] x++ VAL [X=199, Y=1, counter=65, v=-67, x=65, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=199, Y=1, counter=66, v=-67, 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=199, Y=1, counter=66, v=-67, 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=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=66, v=-65, x=65, xy=0, y=0, yx=65] [L45] x++ VAL [X=199, Y=1, counter=66, v=-65, x=66, xy=0, y=0, yx=65] [L31] EXPR counter++ VAL [X=199, Y=1, counter=67, v=-65, 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=199, Y=1, counter=67, v=-65, 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=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=67, v=-63, x=66, xy=0, y=0, yx=66] [L45] x++ VAL [X=199, Y=1, counter=67, v=-63, x=67, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=199, Y=1, counter=68, v=-63, 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=199, Y=1, counter=68, v=-63, 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=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=68, v=-61, x=67, xy=0, y=0, yx=67] [L45] x++ VAL [X=199, Y=1, counter=68, v=-61, x=68, xy=0, y=0, yx=67] [L31] EXPR counter++ VAL [X=199, Y=1, counter=69, v=-61, 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=199, Y=1, counter=69, v=-61, 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=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=69, v=-59, x=68, xy=0, y=0, yx=68] [L45] x++ VAL [X=199, Y=1, counter=69, v=-59, x=69, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=199, Y=1, counter=70, v=-59, 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=199, Y=1, counter=70, v=-59, 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=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=70, v=-57, x=69, xy=0, y=0, yx=69] [L45] x++ VAL [X=199, Y=1, counter=70, v=-57, x=70, xy=0, y=0, yx=69] [L31] EXPR counter++ VAL [X=199, Y=1, counter=71, v=-57, 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=199, Y=1, counter=71, v=-57, 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=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=71, v=-55, x=70, xy=0, y=0, yx=70] [L45] x++ VAL [X=199, Y=1, counter=71, v=-55, x=71, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=199, Y=1, counter=72, v=-55, 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=199, Y=1, counter=72, v=-55, 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=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=72, v=-53, x=71, xy=0, y=0, yx=71] [L45] x++ VAL [X=199, Y=1, counter=72, v=-53, x=72, xy=0, y=0, yx=71] [L31] EXPR counter++ VAL [X=199, Y=1, counter=73, v=-53, 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=199, Y=1, counter=73, v=-53, 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=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=73, v=-51, x=72, xy=0, y=0, yx=72] [L45] x++ VAL [X=199, Y=1, counter=73, v=-51, x=73, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=199, Y=1, counter=74, v=-51, 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=199, Y=1, counter=74, v=-51, 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=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=74, v=-49, x=73, xy=0, y=0, yx=73] [L45] x++ VAL [X=199, Y=1, counter=74, v=-49, x=74, xy=0, y=0, yx=73] [L31] EXPR counter++ VAL [X=199, Y=1, counter=75, v=-49, 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=199, Y=1, counter=75, v=-49, 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=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=75, v=-47, x=74, xy=0, y=0, yx=74] [L45] x++ VAL [X=199, Y=1, counter=75, v=-47, x=75, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=199, Y=1, counter=76, v=-47, 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=199, Y=1, counter=76, v=-47, 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=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=76, v=-45, x=75, xy=0, y=0, yx=75] [L45] x++ VAL [X=199, Y=1, counter=76, v=-45, x=76, xy=0, y=0, yx=75] [L31] EXPR counter++ VAL [X=199, Y=1, counter=77, v=-45, 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=199, Y=1, counter=77, v=-45, 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=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=77, v=-43, x=76, xy=0, y=0, yx=76] [L45] x++ VAL [X=199, Y=1, counter=77, v=-43, x=77, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=199, Y=1, counter=78, v=-43, 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=199, Y=1, counter=78, v=-43, 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=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=78, v=-41, x=77, xy=0, y=0, yx=77] [L45] x++ VAL [X=199, Y=1, counter=78, v=-41, x=78, xy=0, y=0, yx=77] [L31] EXPR counter++ VAL [X=199, Y=1, counter=79, v=-41, 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=199, Y=1, counter=79, v=-41, 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=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=79, v=-39, x=78, xy=0, y=0, yx=78] [L45] x++ VAL [X=199, Y=1, counter=79, v=-39, x=79, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=199, Y=1, counter=80, v=-39, 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=199, Y=1, counter=80, v=-39, 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=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=80, v=-37, x=79, xy=0, y=0, yx=79] [L45] x++ VAL [X=199, Y=1, counter=80, v=-37, x=80, xy=0, y=0, yx=79] [L31] EXPR counter++ VAL [X=199, Y=1, counter=81, v=-37, 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=199, Y=1, counter=81, v=-37, 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=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=81, v=-35, x=80, xy=0, y=0, yx=80] [L45] x++ VAL [X=199, Y=1, counter=81, v=-35, x=81, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=199, Y=1, counter=82, v=-35, 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=199, Y=1, counter=82, v=-35, 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=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=82, v=-33, x=81, xy=0, y=0, yx=81] [L45] x++ VAL [X=199, Y=1, counter=82, v=-33, x=82, xy=0, y=0, yx=81] [L31] EXPR counter++ VAL [X=199, Y=1, counter=83, v=-33, 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=199, Y=1, counter=83, v=-33, 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=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=83, v=-31, x=82, xy=0, y=0, yx=82] [L45] x++ VAL [X=199, Y=1, counter=83, v=-31, x=83, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=199, Y=1, counter=84, v=-31, 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=199, Y=1, counter=84, v=-31, 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=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=84, v=-29, x=83, xy=0, y=0, yx=83] [L45] x++ VAL [X=199, Y=1, counter=84, v=-29, x=84, xy=0, y=0, yx=83] [L31] EXPR counter++ VAL [X=199, Y=1, counter=85, v=-29, 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=199, Y=1, counter=85, v=-29, 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=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=85, v=-27, x=84, xy=0, y=0, yx=84] [L45] x++ VAL [X=199, Y=1, counter=85, v=-27, x=85, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=199, Y=1, counter=86, v=-27, 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=199, Y=1, counter=86, v=-27, 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=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=86, v=-25, x=85, xy=0, y=0, yx=85] [L45] x++ VAL [X=199, Y=1, counter=86, v=-25, x=86, xy=0, y=0, yx=85] [L31] EXPR counter++ VAL [X=199, Y=1, counter=87, v=-25, 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=199, Y=1, counter=87, v=-25, 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=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=87, v=-23, x=86, xy=0, y=0, yx=86] [L45] x++ VAL [X=199, Y=1, counter=87, v=-23, x=87, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=199, Y=1, counter=88, v=-23, 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=199, Y=1, counter=88, v=-23, 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=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=88, v=-21, x=87, xy=0, y=0, yx=87] [L45] x++ VAL [X=199, Y=1, counter=88, v=-21, x=88, xy=0, y=0, yx=87] [L31] EXPR counter++ VAL [X=199, Y=1, counter=89, v=-21, 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=199, Y=1, counter=89, v=-21, 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=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=89, v=-19, x=88, xy=0, y=0, yx=88] [L45] x++ VAL [X=199, Y=1, counter=89, v=-19, x=89, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=199, Y=1, counter=90, v=-19, 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=199, Y=1, counter=90, v=-19, 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=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=90, v=-17, x=89, xy=0, y=0, yx=89] [L45] x++ VAL [X=199, Y=1, counter=90, v=-17, x=90, xy=0, y=0, yx=89] [L31] EXPR counter++ VAL [X=199, Y=1, counter=91, v=-17, 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=199, Y=1, counter=91, v=-17, 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=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=91, v=-15, x=90, xy=0, y=0, yx=90] [L45] x++ VAL [X=199, Y=1, counter=91, v=-15, x=91, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=199, Y=1, counter=92, v=-15, 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=199, Y=1, counter=92, v=-15, 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=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=92, v=-13, x=91, xy=0, y=0, yx=91] [L45] x++ VAL [X=199, Y=1, counter=92, v=-13, x=92, xy=0, y=0, yx=91] [L31] EXPR counter++ VAL [X=199, Y=1, counter=93, v=-13, 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=199, Y=1, counter=93, v=-13, 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=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=93, v=-11, x=92, xy=0, y=0, yx=92] [L45] x++ VAL [X=199, Y=1, counter=93, v=-11, x=93, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=199, Y=1, counter=94, v=-11, 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=199, Y=1, counter=94, v=-11, 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=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=94, v=-9, x=93, xy=0, y=0, yx=93] [L45] x++ VAL [X=199, Y=1, counter=94, v=-9, x=94, xy=0, y=0, yx=93] [L31] EXPR counter++ VAL [X=199, Y=1, counter=95, v=-9, 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=199, Y=1, counter=95, v=-9, 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=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=95, v=-7, x=94, xy=0, y=0, yx=94] [L45] x++ VAL [X=199, Y=1, counter=95, v=-7, x=95, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=199, Y=1, counter=96, v=-7, 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=199, Y=1, counter=96, v=-7, 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=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=96, v=-5, x=95, xy=0, y=0, yx=95] [L45] x++ VAL [X=199, Y=1, counter=96, v=-5, x=96, xy=0, y=0, yx=95] [L31] EXPR counter++ VAL [X=199, Y=1, counter=97, v=-5, 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=199, Y=1, counter=97, v=-5, 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=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=97, v=-3, x=96, xy=0, y=0, yx=96] [L45] x++ VAL [X=199, Y=1, counter=97, v=-3, x=97, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=199, Y=1, counter=98, v=-3, 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=199, Y=1, counter=98, v=-3, 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=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=98, v=-1, x=97, xy=0, y=0, yx=97] [L45] x++ VAL [X=199, Y=1, counter=98, v=-1, x=98, xy=0, y=0, yx=97] [L31] EXPR counter++ VAL [X=199, Y=1, counter=99, v=-1, 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=199, Y=1, counter=99, v=-1, 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=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=99, v=1, x=98, xy=0, y=0, yx=98] [L45] x++ VAL [X=199, Y=1, counter=99, v=1, x=99, xy=0, y=0, yx=98] [L31] EXPR counter++ VAL [X=199, Y=1, counter=100, v=1, 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=199, Y=1, counter=100, v=1, 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=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=100, v=1, 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=199, Y=1, counter=100, v=-395, x=99, xy=0, y=1, yx=99] [L45] x++ VAL [X=199, Y=1, counter=100, v=-395, x=100, xy=0, y=1, yx=99] [L31] EXPR counter++ VAL [X=199, Y=1, counter=101, v=-395, 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=199, Y=1, counter=101, v=-395, 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.6s, OverallIterations: 16, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1690 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1685 mSDsluCounter, 2695 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2469 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2445 IncrementalHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 226 mSDtfsCounter, 2445 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3188 GetRequests, 2509 SyntacticMatches, 14 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13979 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2006occurred in iteration=15, InterpolantAutomatonStates: 625, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 119 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 4567 NumberOfCodeBlocks, 4457 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 3669 ConstructedInterpolants, 6 QuantifiedInterpolants, 11400 SizeOfPredicates, 125 NumberOfNonLiveVariables, 3210 ConjunctsInSsa, 349 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 14518/49938 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 14:15:17,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a0395f-caac-429e-a600-8d9a03710cdd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE