./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:14,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:14,168 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:14:14,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:14,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:14,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:14,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:14,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:14,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:14,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:14,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:14,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:14,225 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:14,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:14,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:14,228 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:14,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:14,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:14,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:14,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:14,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:14,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:14,231 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:14,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:14,231 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:14,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:14,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:14,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:14,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:14,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:14,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:14,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:14,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:14,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:14,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:14,236 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:14,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:14,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:14,237 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:14,237 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2023-11-06 21:14:14,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:14,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:14,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:14,585 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:14,586 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:14,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-11-06 21:14:17,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:17,893 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:17,893 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-11-06 21:14:17,901 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/data/734225739/8ea4aa65d4db4e36b7dee711ef6b6180/FLAG487eb0fce [2023-11-06 21:14:17,915 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/data/734225739/8ea4aa65d4db4e36b7dee711ef6b6180 [2023-11-06 21:14:17,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:17,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:17,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:17,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:17,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:17,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:17" (1/1) ... [2023-11-06 21:14:17,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177c38b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:17, skipping insertion in model container [2023-11-06 21:14:17,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:17" (1/1) ... [2023-11-06 21:14:17,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:18,158 WARN L240 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_18f3a60a-8ee2-4aff-ac36-86baad7effaa/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2023-11-06 21:14:18,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:18,203 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:18,220 WARN L240 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_18f3a60a-8ee2-4aff-ac36-86baad7effaa/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2023-11-06 21:14:18,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:18,245 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:18,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18 WrapperNode [2023-11-06 21:14:18,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:18,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:18,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:18,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:18,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,288 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-06 21:14:18,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:18,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:18,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:18,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:18,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:18,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:18,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:18,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:18,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (1/1) ... [2023-11-06 21:14:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:18,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:18,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:18,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:18,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 21:14:18,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 21:14:18,466 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:18,469 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:18,679 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:18,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:18,703 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:18,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:18 BoogieIcfgContainer [2023-11-06 21:14:18,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:18,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:18,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:18,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:18,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:17" (1/3) ... [2023-11-06 21:14:18,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f8f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:18, skipping insertion in model container [2023-11-06 21:14:18,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:18" (2/3) ... [2023-11-06 21:14:18,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f8f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:18, skipping insertion in model container [2023-11-06 21:14:18,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:18" (3/3) ... [2023-11-06 21:14:18,714 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-11-06 21:14:18,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:18,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:18,780 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:18,786 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@424575c3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:18,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:18,791 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) [2023-11-06 21:14:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 21:14:18,797 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:18,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:18,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:18,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-11-06 21:14:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126106210] [2023-11-06 21:14:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:18,926 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796603055] [2023-11-06 21:14:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:18,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:18,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:18,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:14:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 21:14:19,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:19,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126106210] [2023-11-06 21:14:19,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796603055] [2023-11-06 21:14:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796603055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:14:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250014145] [2023-11-06 21:14:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:19,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:14:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:14:19,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:14:19,288 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) [2023-11-06 21:14:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:19,425 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2023-11-06 21:14:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:14:19,428 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 [2023-11-06 21:14:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:19,436 INFO L225 Difference]: With dead ends: 52 [2023-11-06 21:14:19,436 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 21:14:19,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:14:19,443 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:19,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 62 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:14:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 21:14:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-11-06 21:14:19,479 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) [2023-11-06 21:14:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-06 21:14:19,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-11-06 21:14:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:19,482 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-06 21:14:19,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-06 21:14:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 21:14:19,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:19,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:19,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:19,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 21:14:19,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:19,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-11-06 21:14:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525781792] [2023-11-06 21:14:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:19,706 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323116910] [2023-11-06 21:14:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:19,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:19,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:19,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:19,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:14:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 21:14:19,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:20,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:14:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525781792] [2023-11-06 21:14:20,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323116910] [2023-11-06 21:14:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323116910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:20,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-11-06 21:14:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283708031] [2023-11-06 21:14:20,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:20,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:14:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:14:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:14:20,289 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:14:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:20,564 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-11-06 21:14:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:14:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-06 21:14:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:20,568 INFO L225 Difference]: With dead ends: 41 [2023-11-06 21:14:20,568 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 21:14:20,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:14:20,572 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:20,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:14:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 21:14:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-11-06 21:14:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:14:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-06 21:14:20,592 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-11-06 21:14:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-06 21:14:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:14:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-06 21:14:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 21:14:20,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:20,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:20,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:20,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:20,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:20,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-11-06 21:14:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095105641] [2023-11-06 21:14:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:20,817 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316476377] [2023-11-06 21:14:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:20,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:20,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:20,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:14:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:14:20,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:20,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095105641] [2023-11-06 21:14:21,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316476377] [2023-11-06 21:14:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316476377] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:21,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-11-06 21:14:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208732319] [2023-11-06 21:14:21,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:21,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:14:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:14:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:14:21,012 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:14:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:21,101 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-11-06 21:14:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:14:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-06 21:14:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:21,103 INFO L225 Difference]: With dead ends: 73 [2023-11-06 21:14:21,103 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 21:14:21,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:14:21,105 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:21,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 91 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 21:14:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-11-06 21:14:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 21:14:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-11-06 21:14:21,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-11-06 21:14:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:21,133 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-11-06 21:14:21,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:14:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-11-06 21:14:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 21:14:21,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:21,135 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:21,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:21,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:21,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:21,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-11-06 21:14:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913385938] [2023-11-06 21:14:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:21,354 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:21,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082958005] [2023-11-06 21:14:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:21,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:21,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:21,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:14:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:21,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 21:14:21,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 21:14:21,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:14:22,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:22,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913385938] [2023-11-06 21:14:22,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082958005] [2023-11-06 21:14:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082958005] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:22,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:22,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-11-06 21:14:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570572206] [2023-11-06 21:14:22,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:22,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:14:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:14:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:14:22,208 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:14:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:23,082 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-11-06 21:14:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 21:14:23,083 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-11-06 21:14:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:23,084 INFO L225 Difference]: With dead ends: 65 [2023-11-06 21:14:23,084 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 21:14:23,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 21:14:23,087 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:23,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 135 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:14:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 21:14:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-11-06 21:14:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:14:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-06 21:14:23,104 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-11-06 21:14:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:23,104 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-06 21:14:23,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:14:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-06 21:14:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 21:14:23,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:23,107 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:23,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:23,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:23,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:23,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-11-06 21:14:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328716038] [2023-11-06 21:14:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:23,328 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731522493] [2023-11-06 21:14:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:23,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:23,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:23,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:14:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:23,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 21:14:23,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:23,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 21:14:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328716038] [2023-11-06 21:14:23,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731522493] [2023-11-06 21:14:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731522493] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:23,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-11-06 21:14:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754724605] [2023-11-06 21:14:23,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:23,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:14:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:14:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:14:23,646 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 21:14:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:23,842 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-11-06 21:14:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:14:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-11-06 21:14:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:23,851 INFO L225 Difference]: With dead ends: 116 [2023-11-06 21:14:23,851 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 21:14:23,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:14:23,853 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:23,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 146 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:14:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 21:14:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-06 21:14:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:14:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-11-06 21:14:23,899 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-11-06 21:14:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:23,900 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-11-06 21:14:23,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 21:14:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-11-06 21:14:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 21:14:23,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:23,905 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:23,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:24,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:24,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:24,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-11-06 21:14:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:24,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092100754] [2023-11-06 21:14:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:24,126 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626106385] [2023-11-06 21:14:24,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:14:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:24,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:24,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 21:14:24,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:14:24,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:14:24,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 21:14:24,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:24,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 21:14:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092100754] [2023-11-06 21:14:24,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:24,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626106385] [2023-11-06 21:14:24,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626106385] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:24,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-11-06 21:14:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807762069] [2023-11-06 21:14:24,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:24,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 21:14:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 21:14:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-11-06 21:14:24,846 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:14:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:25,423 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-11-06 21:14:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-06 21:14:25,423 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2023-11-06 21:14:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:25,426 INFO L225 Difference]: With dead ends: 236 [2023-11-06 21:14:25,426 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 21:14:25,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 21:14:25,429 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 166 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:25,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 215 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:14:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 21:14:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 21:14:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 21:14:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-11-06 21:14:25,484 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-11-06 21:14:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:25,485 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-11-06 21:14:25,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:14:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-11-06 21:14:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-06 21:14:25,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:25,491 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:25,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 21:14:25,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 21:14:25,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:25,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:25,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-11-06 21:14:25,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892752913] [2023-11-06 21:14:25,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:25,725 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190929308] [2023-11-06 21:14:25,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:14:25,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:25,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:25,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:25,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 21:14:25,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 21:14:25,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:14:25,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 21:14:25,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-06 21:14:26,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-06 21:14:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892752913] [2023-11-06 21:14:26,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190929308] [2023-11-06 21:14:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190929308] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:26,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-06 21:14:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040653864] [2023-11-06 21:14:26,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:26,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:14:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:14:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:14:26,698 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:14:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:27,019 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-11-06 21:14:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:14:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2023-11-06 21:14:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:27,025 INFO L225 Difference]: With dead ends: 449 [2023-11-06 21:14:27,025 INFO L226 Difference]: Without dead ends: 443 [2023-11-06 21:14:27,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:14:27,027 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:27,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:14:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-06 21:14:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-11-06 21:14:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-06 21:14:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-11-06 21:14:27,159 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-11-06 21:14:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:27,160 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-11-06 21:14:27,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:14:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-11-06 21:14:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-06 21:14:27,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:27,165 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:27,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:27,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:27,372 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:27,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-11-06 21:14:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:27,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450100527] [2023-11-06 21:14:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:27,407 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:27,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581707103] [2023-11-06 21:14:27,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:27,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:27,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:27,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 21:14:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:27,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-06 21:14:27,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:28,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-06 21:14:29,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:29,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450100527] [2023-11-06 21:14:29,338 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:29,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581707103] [2023-11-06 21:14:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581707103] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:29,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-11-06 21:14:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696522381] [2023-11-06 21:14:29,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:29,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 21:14:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 21:14:29,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-11-06 21:14:29,345 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:14:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:31,188 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-11-06 21:14:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-11-06 21:14:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2023-11-06 21:14:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:31,197 INFO L225 Difference]: With dead ends: 929 [2023-11-06 21:14:31,198 INFO L226 Difference]: Without dead ends: 923 [2023-11-06 21:14:31,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-11-06 21:14:31,206 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 337 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:31,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 383 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:14:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-11-06 21:14:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-11-06 21:14:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2023-11-06 21:14:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-11-06 21:14:31,421 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-11-06 21:14:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:31,422 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-11-06 21:14:31,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:14:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-11-06 21:14:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-11-06 21:14:31,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:31,437 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:31,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:31,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:31,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:31,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-11-06 21:14:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039413930] [2023-11-06 21:14:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:31,702 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446246942] [2023-11-06 21:14:31,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:14:31,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:31,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:31,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:31,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 21:14:32,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:14:32,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:14:32,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-06 21:14:32,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:33,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-11-06 21:14:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039413930] [2023-11-06 21:14:35,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:35,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446246942] [2023-11-06 21:14:35,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446246942] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:35,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:14:35,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-11-06 21:14:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651662526] [2023-11-06 21:14:35,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-06 21:14:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-06 21:14:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-11-06 21:14:35,805 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-11-06 21:14:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:37,877 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2023-11-06 21:14:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-06 21:14:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2023-11-06 21:14:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:37,890 INFO L225 Difference]: With dead ends: 1009 [2023-11-06 21:14:37,890 INFO L226 Difference]: Without dead ends: 1003 [2023-11-06 21:14:37,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-11-06 21:14:37,897 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 170 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:37,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 407 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:14:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2023-11-06 21:14:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2023-11-06 21:14:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-11-06 21:14:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2023-11-06 21:14:38,092 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2023-11-06 21:14:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:38,093 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2023-11-06 21:14:38,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-11-06 21:14:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2023-11-06 21:14:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-11-06 21:14:38,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:38,106 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:38,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:38,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:38,324 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:38,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2023-11-06 21:14:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602522313] [2023-11-06 21:14:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:38,383 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:38,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712446883] [2023-11-06 21:14:38,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:14:38,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:38,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:38,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:38,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 21:14:39,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-11-06 21:14:39,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 21:14:39,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:39,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:39,457 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:14:39,458 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:14:39,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:39,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:39,673 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-11-06 21:14:39,680 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:14:39,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:14:39 BoogieIcfgContainer [2023-11-06 21:14:39,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:14:39,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:14:39,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:14:39,906 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:14:39,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:18" (3/4) ... [2023-11-06 21:14:39,907 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 21:14:40,117 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:14:40,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:14:40,118 INFO L158 Benchmark]: Toolchain (without parser) took 22198.33ms. Allocated memory was 136.3MB in the beginning and 297.8MB in the end (delta: 161.5MB). Free memory was 92.5MB in the beginning and 242.7MB in the end (delta: -150.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,118 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:40,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.79ms. Allocated memory is still 136.3MB. Free memory was 92.2MB in the beginning and 81.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.46ms. Allocated memory is still 136.3MB. Free memory was 81.4MB in the beginning and 79.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,120 INFO L158 Benchmark]: Boogie Preprocessor took 22.39ms. Allocated memory is still 136.3MB. Free memory was 79.8MB in the beginning and 78.9MB in the end (delta: 849.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,120 INFO L158 Benchmark]: RCFGBuilder took 388.86ms. Allocated memory is still 136.3MB. Free memory was 78.6MB in the beginning and 108.7MB in the end (delta: -30.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,121 INFO L158 Benchmark]: TraceAbstraction took 21197.27ms. Allocated memory was 136.3MB in the beginning and 297.8MB in the end (delta: 161.5MB). Free memory was 107.8MB in the beginning and 259.8MB in the end (delta: -152.0MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,121 INFO L158 Benchmark]: Witness Printer took 211.87ms. Allocated memory is still 297.8MB. Free memory was 259.8MB in the beginning and 242.7MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,123 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.27ms. Allocated memory is still 94.4MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.79ms. Allocated memory is still 136.3MB. Free memory was 92.2MB in the beginning and 81.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.46ms. Allocated memory is still 136.3MB. Free memory was 81.4MB in the beginning and 79.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.39ms. Allocated memory is still 136.3MB. Free memory was 79.8MB in the beginning and 78.9MB in the end (delta: 849.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.86ms. Allocated memory is still 136.3MB. Free memory was 78.6MB in the beginning and 108.7MB in the end (delta: -30.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21197.27ms. Allocated memory was 136.3MB in the beginning and 297.8MB in the end (delta: 161.5MB). Free memory was 107.8MB in the beginning and 259.8MB in the end (delta: -152.0MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. * Witness Printer took 211.87ms. Allocated memory is still 297.8MB. Free memory was 259.8MB in the beginning and 242.7MB in the end (delta: 17.0MB). Peak memory consumption was 18.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=99, Y=1, counter=0, v=-97, x=0, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=0, counter=1, v=-97, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=1, v=-97, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=1, v=-97, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=1, v=-97, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=1, v=-95, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=99, Y=1, counter=1, v=-95, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=1, counter=2, v=-95, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=2, v=-95, x=0, x=1, x=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=2, v=-95, x=0, x=1, x=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=2, v=-95, x=0, x=1, x=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=2, v=-93, x=0, x=1, x=1, y=0] [L45] x++ VAL [X=99, Y=1, counter=2, v=-93, x=0, x=1, x=2, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=2, counter=3, v=-93, x=0, x=1, x=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=3, v=-93, x=0, x=2, x=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=3, v=-93, x=0, x=2, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=3, v=-93, x=0, x=2, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=3, v=-91, x=0, x=2, x=2, y=0] [L45] x++ VAL [X=99, Y=1, counter=3, v=-91, x=0, x=2, x=3, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=3, counter=4, v=-91, x=0, x=2, x=3, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=4, v=-91, x=0, x=3, x=3, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=4, v=-91, x=0, x=3, x=3, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=4, v=-91, x=0, x=3, x=3, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=4, v=-89, x=0, x=3, x=3, y=0] [L45] x++ VAL [X=99, Y=1, counter=4, v=-89, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=4, counter=5, v=-89, x=0, x=3, x=4, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=5, v=-89, x=0, x=4, x=4, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=5, v=-89, x=0, x=4, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=5, v=-89, x=0, x=4, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=5, v=-87, x=0, x=4, x=4, y=0] [L45] x++ VAL [X=99, Y=1, counter=5, v=-87, x=0, x=4, x=5, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=5, counter=6, v=-87, x=0, x=4, x=5, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=6, v=-87, x=0, x=5, x=5, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=6, v=-87, x=0, x=5, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=6, v=-87, x=0, x=5, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=6, v=-85, x=0, x=5, x=5, y=0] [L45] x++ VAL [X=99, Y=1, counter=6, v=-85, x=0, x=5, x=6, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=6, counter=7, v=-85, x=0, x=5, x=6, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=7, v=-85, x=0, x=6, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=7, v=-85, x=0, x=6, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=7, v=-85, x=0, x=6, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=7, v=-83, x=0, x=6, x=6, y=0] [L45] x++ VAL [X=99, Y=1, counter=7, v=-83, x=0, x=6, x=7, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=7, counter=8, v=-83, x=0, x=6, x=7, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=8, v=-83, x=0, x=7, x=7, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=8, v=-83, x=0, x=7, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=8, v=-83, x=0, x=7, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=8, v=-81, x=0, x=7, x=7, y=0] [L45] x++ VAL [X=99, Y=1, counter=8, v=-81, x=0, x=7, x=8, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=8, counter=9, v=-81, x=0, x=7, x=8, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=9, v=-81, x=0, x=8, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=9, v=-81, x=0, x=8, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=9, v=-81, x=0, x=8, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=9, v=-79, x=0, x=8, x=8, y=0] [L45] x++ VAL [X=99, Y=1, counter=9, v=-79, x=0, x=8, x=9, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=9, counter=10, v=-79, x=0, x=8, x=9, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=10, v=-79, x=0, x=9, x=9, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=10, v=-79, x=0, x=9, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=10, v=-79, x=0, x=9, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=10, v=-77, x=0, x=9, x=9, y=0] [L45] x++ VAL [X=99, Y=1, counter=10, v=-77, x=0, x=10, x=9, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=10, counter=11, v=-77, x=0, x=10, x=9, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=11, v=-77, x=0, x=10, x=10, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=11, v=-77, x=0, x=10, x=10, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=11, v=-77, x=0, x=10, x=10, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=11, v=-75, x=0, x=10, x=10, y=0] [L45] x++ VAL [X=99, Y=1, counter=11, v=-75, x=0, x=10, x=11, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=11, counter=12, v=-75, x=0, x=10, x=11, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=12, v=-75, x=0, x=11, x=11, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=12, v=-75, x=0, x=11, x=11, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=12, v=-75, x=0, x=11, x=11, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=12, v=-73, x=0, x=11, x=11, y=0] [L45] x++ VAL [X=99, Y=1, counter=12, v=-73, x=0, x=11, x=12, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=12, counter=13, v=-73, x=0, x=11, x=12, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=13, v=-73, x=0, x=12, x=12, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=13, v=-73, x=0, x=12, x=12, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=13, v=-73, x=0, x=12, x=12, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=13, v=-71, x=0, x=12, x=12, y=0] [L45] x++ VAL [X=99, Y=1, counter=13, v=-71, x=0, x=12, x=13, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=13, counter=14, v=-71, x=0, x=12, x=13, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=14, v=-71, x=0, x=13, x=13, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=14, v=-71, x=0, x=13, x=13, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=14, v=-71, x=0, x=13, x=13, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=14, v=-69, x=0, x=13, x=13, y=0] [L45] x++ VAL [X=99, Y=1, counter=14, v=-69, x=0, x=13, x=14, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=14, counter=15, v=-69, x=0, x=13, x=14, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=15, v=-69, x=0, x=14, x=14, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=15, v=-69, x=0, x=14, x=14, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=15, v=-69, x=0, x=14, x=14, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=15, v=-67, x=0, x=14, x=14, y=0] [L45] x++ VAL [X=99, Y=1, counter=15, v=-67, x=0, x=14, x=15, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=15, counter=16, v=-67, x=0, x=14, x=15, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=16, v=-67, x=0, x=15, x=15, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=16, v=-67, x=0, x=15, x=15, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=16, v=-67, x=0, x=15, x=15, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=16, v=-65, x=0, x=15, x=15, y=0] [L45] x++ VAL [X=99, Y=1, counter=16, v=-65, x=0, x=15, x=16, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=16, counter=17, v=-65, x=0, x=15, x=16, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=17, v=-65, x=0, x=16, x=16, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=17, v=-65, x=0, x=16, x=16, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=17, v=-65, x=0, x=16, x=16, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=17, v=-63, x=0, x=16, x=16, y=0] [L45] x++ VAL [X=99, Y=1, counter=17, v=-63, x=0, x=16, x=17, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=17, counter=18, v=-63, x=0, x=16, x=17, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=18, v=-63, x=0, x=17, x=17, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=18, v=-63, x=0, x=17, x=17, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=18, v=-63, x=0, x=17, x=17, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=18, v=-61, x=0, x=17, x=17, y=0] [L45] x++ VAL [X=99, Y=1, counter=18, v=-61, x=0, x=17, x=18, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=18, counter=19, v=-61, x=0, x=17, x=18, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=19, v=-61, x=0, x=18, x=18, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=19, v=-61, x=0, x=18, x=18, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=19, v=-61, x=0, x=18, x=18, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=19, v=-59, x=0, x=18, x=18, y=0] [L45] x++ VAL [X=99, Y=1, counter=19, v=-59, x=0, x=18, x=19, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=19, counter=20, v=-59, x=0, x=18, x=19, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=20, v=-59, x=0, x=19, x=19, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=20, v=-59, x=0, x=19, x=19, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=20, v=-59, x=0, x=19, x=19, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=20, v=-57, x=0, x=19, x=19, y=0] [L45] x++ VAL [X=99, Y=1, counter=20, v=-57, x=0, x=19, x=20, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=20, counter=21, v=-57, x=0, x=19, x=20, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=21, v=-57, x=0, x=20, x=20, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=21, v=-57, x=0, x=20, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=21, v=-57, x=0, x=20, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=21, v=-55, x=0, x=20, x=20, y=0] [L45] x++ VAL [X=99, Y=1, counter=21, v=-55, x=0, x=20, x=21, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=21, counter=22, v=-55, x=0, x=20, x=21, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=22, v=-55, x=0, x=21, x=21, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=22, v=-55, x=0, x=21, x=21, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=22, v=-55, x=0, x=21, x=21, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=22, v=-53, x=0, x=21, x=21, y=0] [L45] x++ VAL [X=99, Y=1, counter=22, v=-53, x=0, x=21, x=22, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=22, counter=23, v=-53, x=0, x=21, x=22, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=23, v=-53, x=0, x=22, x=22, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=23, v=-53, x=0, x=22, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=23, v=-53, x=0, x=22, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=23, v=-51, x=0, x=22, x=22, y=0] [L45] x++ VAL [X=99, Y=1, counter=23, v=-51, x=0, x=22, x=23, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=23, counter=24, v=-51, x=0, x=22, x=23, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=24, v=-51, x=0, x=23, x=23, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=24, v=-51, x=0, x=23, x=23, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=24, v=-51, x=0, x=23, x=23, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=24, v=-49, x=0, x=23, x=23, y=0] [L45] x++ VAL [X=99, Y=1, counter=24, v=-49, x=0, x=23, x=24, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=24, counter=25, v=-49, x=0, x=23, x=24, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=25, v=-49, x=0, x=24, x=24, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=25, v=-49, x=0, x=24, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=25, v=-49, x=0, x=24, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=25, v=-47, x=0, x=24, x=24, y=0] [L45] x++ VAL [X=99, Y=1, counter=25, v=-47, x=0, x=24, x=25, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=25, counter=26, v=-47, x=0, x=24, x=25, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=26, v=-47, x=0, x=25, x=25, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=26, v=-47, x=0, x=25, x=25, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=26, v=-47, x=0, x=25, x=25, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=26, v=-45, x=0, x=25, x=25, y=0] [L45] x++ VAL [X=99, Y=1, counter=26, v=-45, x=0, x=25, x=26, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=26, counter=27, v=-45, x=0, x=25, x=26, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=27, v=-45, x=0, x=26, x=26, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=27, v=-45, x=0, x=26, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=27, v=-45, x=0, x=26, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=27, v=-43, x=0, x=26, x=26, y=0] [L45] x++ VAL [X=99, Y=1, counter=27, v=-43, x=0, x=26, x=27, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=27, counter=28, v=-43, x=0, x=26, x=27, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=28, v=-43, x=0, x=27, x=27, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=28, v=-43, x=0, x=27, x=27, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=28, v=-43, x=0, x=27, x=27, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=28, v=-41, x=0, x=27, x=27, y=0] [L45] x++ VAL [X=99, Y=1, counter=28, v=-41, x=0, x=27, x=28, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=28, counter=29, v=-41, x=0, x=27, x=28, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=29, v=-41, x=0, x=28, x=28, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=29, v=-41, x=0, x=28, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=29, v=-41, x=0, x=28, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=29, v=-39, x=0, x=28, x=28, y=0] [L45] x++ VAL [X=99, Y=1, counter=29, v=-39, x=0, x=28, x=29, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=29, counter=30, v=-39, x=0, x=28, x=29, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=30, v=-39, x=0, x=29, x=29, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=30, v=-39, x=0, x=29, x=29, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=30, v=-39, x=0, x=29, x=29, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=30, v=-37, x=0, x=29, x=29, y=0] [L45] x++ VAL [X=99, Y=1, counter=30, v=-37, x=0, x=29, x=30, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=30, counter=31, v=-37, x=0, x=29, x=30, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=31, v=-37, x=0, x=30, x=30, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=31, v=-37, x=0, x=30, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=31, v=-37, x=0, x=30, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=31, v=-35, x=0, x=30, x=30, y=0] [L45] x++ VAL [X=99, Y=1, counter=31, v=-35, x=0, x=30, x=31, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=31, counter=32, v=-35, x=0, x=30, x=31, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=32, v=-35, x=0, x=31, x=31, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=32, v=-35, x=0, x=31, x=31, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=32, v=-35, x=0, x=31, x=31, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=32, v=-33, x=0, x=31, x=31, y=0] [L45] x++ VAL [X=99, Y=1, counter=32, v=-33, x=0, x=31, x=32, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=32, counter=33, v=-33, x=0, x=31, x=32, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=33, v=-33, x=0, x=32, x=32, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=33, v=-33, x=0, x=32, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=33, v=-33, x=0, x=32, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=33, v=-31, x=0, x=32, x=32, y=0] [L45] x++ VAL [X=99, Y=1, counter=33, v=-31, x=0, x=32, x=33, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=33, counter=34, v=-31, x=0, x=32, x=33, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=34, v=-31, x=0, x=33, x=33, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=34, v=-31, x=0, x=33, x=33, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=34, v=-31, x=0, x=33, x=33, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=34, v=-29, x=0, x=33, x=33, y=0] [L45] x++ VAL [X=99, Y=1, counter=34, v=-29, x=0, x=33, x=34, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=34, counter=35, v=-29, x=0, x=33, x=34, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=35, v=-29, x=0, x=34, x=34, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=35, v=-29, x=0, x=34, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=35, v=-29, x=0, x=34, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=35, v=-27, x=0, x=34, x=34, y=0] [L45] x++ VAL [X=99, Y=1, counter=35, v=-27, x=0, x=34, x=35, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=35, counter=36, v=-27, x=0, x=34, x=35, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=36, v=-27, x=0, x=35, x=35, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=36, v=-27, x=0, x=35, x=35, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=36, v=-27, x=0, x=35, x=35, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=36, v=-25, x=0, x=35, x=35, y=0] [L45] x++ VAL [X=99, Y=1, counter=36, v=-25, x=0, x=35, x=36, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=36, counter=37, v=-25, x=0, x=35, x=36, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=37, v=-25, x=0, x=36, x=36, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=37, v=-25, x=0, x=36, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=37, v=-25, x=0, x=36, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=37, v=-23, x=0, x=36, x=36, y=0] [L45] x++ VAL [X=99, Y=1, counter=37, v=-23, x=0, x=36, x=37, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=37, counter=38, v=-23, x=0, x=36, x=37, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=38, v=-23, x=0, x=37, x=37, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=38, v=-23, x=0, x=37, x=37, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=38, v=-23, x=0, x=37, x=37, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=38, v=-21, x=0, x=37, x=37, y=0] [L45] x++ VAL [X=99, Y=1, counter=38, v=-21, x=0, x=37, x=38, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=38, counter=39, v=-21, x=0, x=37, x=38, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=39, v=-21, x=0, x=38, x=38, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=39, v=-21, x=0, x=38, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=39, v=-21, x=0, x=38, x=38, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=39, v=-19, x=0, x=38, x=38, y=0] [L45] x++ VAL [X=99, Y=1, counter=39, v=-19, x=0, x=38, x=39, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=39, counter=40, v=-19, x=0, x=38, x=39, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=40, v=-19, x=0, x=39, x=39, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=40, v=-19, x=0, x=39, x=39, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=40, v=-19, x=0, x=39, x=39, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=40, v=-17, x=0, x=39, x=39, y=0] [L45] x++ VAL [X=99, Y=1, counter=40, v=-17, x=0, x=39, x=40, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=40, counter=41, v=-17, x=0, x=39, x=40, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=41, v=-17, x=0, x=40, x=40, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=41, v=-17, x=0, x=40, x=40, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=41, v=-17, x=0, x=40, x=40, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=41, v=-15, x=0, x=40, x=40, y=0] [L45] x++ VAL [X=99, Y=1, counter=41, v=-15, x=0, x=40, x=41, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=41, counter=42, v=-15, x=0, x=40, x=41, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=42, v=-15, x=0, x=41, x=41, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=42, v=-15, x=0, x=41, x=41, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=42, v=-15, x=0, x=41, x=41, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=42, v=-13, x=0, x=41, x=41, y=0] [L45] x++ VAL [X=99, Y=1, counter=42, v=-13, x=0, x=41, x=42, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=42, counter=43, v=-13, x=0, x=41, x=42, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=43, v=-13, x=0, x=42, x=42, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=43, v=-13, x=0, x=42, x=42, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=43, v=-13, x=0, x=42, x=42, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=43, v=-11, x=0, x=42, x=42, y=0] [L45] x++ VAL [X=99, Y=1, counter=43, v=-11, x=0, x=42, x=43, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=43, counter=44, v=-11, x=0, x=42, x=43, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=44, v=-11, x=0, x=43, x=43, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=44, v=-11, x=0, x=43, x=43, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=44, v=-11, x=0, x=43, x=43, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=44, v=-9, x=0, x=43, x=43, y=0] [L45] x++ VAL [X=99, Y=1, counter=44, v=-9, x=0, x=43, x=44, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=44, counter=45, v=-9, x=0, x=43, x=44, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=45, v=-9, x=0, x=44, x=44, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=45, v=-9, x=0, x=44, x=44, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=45, v=-9, x=0, x=44, x=44, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=45, v=-7, x=0, x=44, x=44, y=0] [L45] x++ VAL [X=99, Y=1, counter=45, v=-7, x=0, x=44, x=45, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=45, counter=46, v=-7, x=0, x=44, x=45, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=46, v=-7, x=0, x=45, x=45, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=46, v=-7, x=0, x=45, x=45, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=46, v=-7, x=0, x=45, x=45, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=46, v=-5, x=0, x=45, x=45, y=0] [L45] x++ VAL [X=99, Y=1, counter=46, v=-5, x=0, x=45, x=46, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=46, counter=47, v=-5, x=0, x=45, x=46, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=47, v=-5, x=0, x=46, x=46, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=47, v=-5, x=0, x=46, x=46, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=47, v=-5, x=0, x=46, x=46, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=47, v=-3, x=0, x=46, x=46, y=0] [L45] x++ VAL [X=99, Y=1, counter=47, v=-3, x=0, x=46, x=47, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=47, counter=48, v=-3, x=0, x=46, x=47, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=48, v=-3, x=0, x=47, x=47, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=48, v=-3, x=0, x=47, x=47, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=48, v=-3, x=0, x=47, x=47, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=48, v=-1, x=0, x=47, x=47, y=0] [L45] x++ VAL [X=99, Y=1, counter=48, v=-1, x=0, x=47, x=48, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=48, counter=49, v=-1, x=0, x=47, x=48, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=49, v=-1, x=0, x=48, x=48, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=49, v=-1, x=0, x=48, x=48, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=49, v=-1, x=0, x=48, x=48, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=49, v=1, x=0, x=48, x=48, y=0] [L45] x++ VAL [X=99, Y=1, counter=49, v=1, x=0, x=48, x=49, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=49, counter=50, v=1, x=0, x=48, x=49, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=50, v=1, x=0, x=49, x=49, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=50, v=1, x=0, x=49, x=49, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=50, v=1, x=0, x=49, x=49, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=99, Y=1, counter=50, v=-195, x=0, x=49, x=49, y=1] [L45] x++ VAL [X=99, Y=1, counter=50, v=-195, x=0, x=49, x=50, y=1] [L31] EXPR counter++ VAL [X=99, Y=1, counter++=50, counter=51, v=-195, x=0, x=49, x=50, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=99, Y=1, counter=51, v=-195, x=50, x=50, x=50, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 864 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 1595 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1472 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 123 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2439 GetRequests, 2046 SyntacticMatches, 45 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 1 QuantifiedInterpolants, 6427 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2545 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10289/31834 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! [2023-11-06 21:14:40,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f3a60a-8ee2-4aff-ac36-86baad7effaa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE