./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:01:25,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:01:25,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:01:25,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:01:25,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:01:25,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:01:25,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:01:25,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:01:25,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:01:25,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:01:25,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:01:25,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:01:25,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:01:25,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:01:25,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:01:25,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:01:25,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:01:25,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:01:25,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:01:25,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:01:25,316 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2025-02-05 15:01:25,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:01:25,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:01:25,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:01:25,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:01:25,488 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:01:25,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2025-02-05 15:01:26,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59f111e04/907b4124d508407f9fb7fffd347e1456/FLAGeb49e8c98 [2025-02-05 15:01:26,865 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:01:26,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2025-02-05 15:01:26,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59f111e04/907b4124d508407f9fb7fffd347e1456/FLAGeb49e8c98 [2025-02-05 15:01:27,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59f111e04/907b4124d508407f9fb7fffd347e1456 [2025-02-05 15:01:27,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:01:27,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:01:27,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:01:27,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:01:27,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:01:27,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12948a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27, skipping insertion in model container [2025-02-05 15:01:27,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:01:27,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2025-02-05 15:01:27,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:01:27,318 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:01:27,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2025-02-05 15:01:27,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:01:27,342 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:01:27,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27 WrapperNode [2025-02-05 15:01:27,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:01:27,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:01:27,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:01:27,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:01:27,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,361 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-02-05 15:01:27,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:01:27,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:01:27,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:01:27,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:01:27,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,378 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:01:27,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:01:27,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:01:27,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:01:27,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:01:27,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (1/1) ... [2025-02-05 15:01:27,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:01:27,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:27,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:01:27,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:01:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:01:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:01:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:01:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:01:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:01:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:01:27,476 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:01:27,477 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:01:27,585 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 15:01:27,586 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:01:27,591 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:01:27,592 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:01:27,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:01:27 BoogieIcfgContainer [2025-02-05 15:01:27,592 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:01:27,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:01:27,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:01:27,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:01:27,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:01:27" (1/3) ... [2025-02-05 15:01:27,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba2bbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:01:27, skipping insertion in model container [2025-02-05 15:01:27,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:27" (2/3) ... [2025-02-05 15:01:27,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba2bbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:01:27, skipping insertion in model container [2025-02-05 15:01:27,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:01:27" (3/3) ... [2025-02-05 15:01:27,598 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2025-02-05 15:01:27,607 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:01:27,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound100.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:01:27,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:01:27,652 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60c74497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:01:27,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:01:27,654 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) [2025-02-05 15:01:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 15:01:27,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:27,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:27,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:27,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2131387279, now seen corresponding path program 1 times [2025-02-05 15:01:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494178741] [2025-02-05 15:01:27,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:27,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:01:27,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:01:27,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:27,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494178741] [2025-02-05 15:01:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494178741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:01:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800450290] [2025-02-05 15:01:27,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:27,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:01:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:27,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:01:27,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:01:27,768 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:27,777 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-02-05 15:01:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:01:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 15:01:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:27,782 INFO L225 Difference]: With dead ends: 38 [2025-02-05 15:01:27,782 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 15:01:27,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:01:27,786 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:27,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 15:01:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-05 15:01:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:01:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-05 15:01:27,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2025-02-05 15:01:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:27,805 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-05 15:01:27,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-05 15:01:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 15:01:27,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:27,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:27,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:01:27,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:27,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2144245658, now seen corresponding path program 1 times [2025-02-05 15:01:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:27,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082170458] [2025-02-05 15:01:27,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:27,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:01:27,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:01:27,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:27,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:27,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365643662] [2025-02-05 15:01:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:27,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:27,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:27,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:01:27,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:01:27,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:01:27,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:27,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:27,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:01:27,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:28,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:01:28,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082170458] [2025-02-05 15:01:28,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365643662] [2025-02-05 15:01:28,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365643662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:28,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:28,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:01:28,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781447191] [2025-02-05 15:01:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:28,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:01:28,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:28,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:01:28,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:01:28,021 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. 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) [2025-02-05 15:01:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:28,092 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-02-05 15:01:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:01:28,095 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 [2025-02-05 15:01:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:28,096 INFO L225 Difference]: With dead ends: 30 [2025-02-05 15:01:28,096 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 15:01:28,097 INFO L434 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 [2025-02-05 15:01:28,097 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:28,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 15:01:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-02-05 15:01:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-05 15:01:28,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2025-02-05 15:01:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:28,105 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-05 15:01:28,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-05 15:01:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 15:01:28,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:28,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:28,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:28,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:28,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1996373859, now seen corresponding path program 1 times [2025-02-05 15:01:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961219757] [2025-02-05 15:01:28,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:28,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 15:01:28,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 15:01:28,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:28,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:28,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961219757] [2025-02-05 15:01:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961219757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:28,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:01:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647922589] [2025-02-05 15:01:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:28,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:01:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:28,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:01:28,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:01:28,405 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:28,421 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-02-05 15:01:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:01:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 15:01:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:28,423 INFO L225 Difference]: With dead ends: 31 [2025-02-05 15:01:28,423 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 15:01:28,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:01:28,424 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:28,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 15:01:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-05 15:01:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-02-05 15:01:28,432 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2025-02-05 15:01:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:28,432 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-05 15:01:28,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-02-05 15:01:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 15:01:28,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:28,433 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:28,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:01:28,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:28,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1260892537, now seen corresponding path program 1 times [2025-02-05 15:01:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455062381] [2025-02-05 15:01:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:28,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:01:28,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:01:28,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:28,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023547044] [2025-02-05 15:01:28,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:28,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:28,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:28,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:01:28,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:01:28,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:01:28,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:28,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:28,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:01:28,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:28,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:01:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455062381] [2025-02-05 15:01:28,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023547044] [2025-02-05 15:01:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023547044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:28,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:28,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:01:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928762008] [2025-02-05 15:01:28,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:28,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:01:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:28,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:01:28,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:01:28,584 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:01:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:28,666 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-02-05 15:01:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:01:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-05 15:01:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:28,667 INFO L225 Difference]: With dead ends: 33 [2025-02-05 15:01:28,667 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 15:01:28,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:01:28,667 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:28,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 15:01:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-02-05 15:01:28,670 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) [2025-02-05 15:01:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-05 15:01:28,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2025-02-05 15:01:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:28,671 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-05 15:01:28,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:01:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-05 15:01:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:01:28,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:28,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:28,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:28,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:28,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:28,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash -578761182, now seen corresponding path program 1 times [2025-02-05 15:01:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093825788] [2025-02-05 15:01:28,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:28,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:01:28,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:01:28,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:28,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264230239] [2025-02-05 15:01:28,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:28,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:28,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:28,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:01:28,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:01:28,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:01:28,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:28,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:28,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 15:01:28,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:29,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:01:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093825788] [2025-02-05 15:01:29,237 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264230239] [2025-02-05 15:01:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264230239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:29,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:01:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-02-05 15:01:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939988393] [2025-02-05 15:01:29,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:29,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:01:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:29,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:01:29,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:01:29,242 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:29,400 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-02-05 15:01:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:01:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 15:01:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:29,402 INFO L225 Difference]: With dead ends: 41 [2025-02-05 15:01:29,402 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 15:01:29,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:01:29,402 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:29,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 15:01:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2025-02-05 15:01:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-05 15:01:29,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2025-02-05 15:01:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:29,411 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-05 15:01:29,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-05 15:01:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:01:29,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:29,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:29,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:01:29,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:29,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:29,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash -812459557, now seen corresponding path program 1 times [2025-02-05 15:01:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603047876] [2025-02-05 15:01:29,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:29,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:01:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:01:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:29,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:29,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603047876] [2025-02-05 15:01:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603047876] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365638213] [2025-02-05 15:01:29,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:29,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:29,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:29,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:01:29,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:01:29,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:01:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:29,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:01:29,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:29,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365638213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:29,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:29,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-05 15:01:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357391770] [2025-02-05 15:01:29,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:29,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:01:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:29,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:01:29,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:01:29,808 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:01:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:29,858 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-02-05 15:01:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:01:29,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-02-05 15:01:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:29,859 INFO L225 Difference]: With dead ends: 68 [2025-02-05 15:01:29,859 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 15:01:29,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:01:29,860 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:29,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 92 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 15:01:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-02-05 15:01:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:01:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-05 15:01:29,870 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2025-02-05 15:01:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:29,870 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-05 15:01:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:01:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-05 15:01:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:01:29,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:29,872 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:29,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:01:30,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 15:01:30,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:30,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash 810324465, now seen corresponding path program 1 times [2025-02-05 15:01:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000440855] [2025-02-05 15:01:30,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:30,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:30,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:30,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105409171] [2025-02-05 15:01:30,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:30,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:30,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:30,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:01:30,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:30,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:30,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:01:30,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:01:30,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:01:30,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000440855] [2025-02-05 15:01:30,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105409171] [2025-02-05 15:01:30,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105409171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:30,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:01:30,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-02-05 15:01:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960246443] [2025-02-05 15:01:30,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:30,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:01:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:30,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:01:30,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:01:30,381 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:01:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:30,495 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2025-02-05 15:01:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:01:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-02-05 15:01:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:30,496 INFO L225 Difference]: With dead ends: 79 [2025-02-05 15:01:30,496 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 15:01:30,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:01:30,497 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:30,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 15:01:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-02-05 15:01:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:01:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-02-05 15:01:30,509 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2025-02-05 15:01:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:30,510 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-05 15:01:30,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:01:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-02-05 15:01:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:01:30,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:30,511 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:30,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:01:30,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:30,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:30,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1977091022, now seen corresponding path program 1 times [2025-02-05 15:01:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517722595] [2025-02-05 15:01:30,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:30,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:30,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:30,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142770480] [2025-02-05 15:01:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:30,725 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:30,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:01:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:30,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:30,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:30,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 15:01:30,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:01:30,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:01:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517722595] [2025-02-05 15:01:31,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142770480] [2025-02-05 15:01:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142770480] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:31,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:01:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-02-05 15:01:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959543578] [2025-02-05 15:01:31,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:31,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:01:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:31,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:01:31,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:01:31,257 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:01:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:31,802 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2025-02-05 15:01:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 15:01:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2025-02-05 15:01:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:31,803 INFO L225 Difference]: With dead ends: 89 [2025-02-05 15:01:31,803 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 15:01:31,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2025-02-05 15:01:31,804 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:31,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 135 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:01:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 15:01:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-05 15:01:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:01:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-02-05 15:01:31,825 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 25 [2025-02-05 15:01:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:31,826 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-02-05 15:01:31,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:01:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-02-05 15:01:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:01:31,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:31,827 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:31,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:32,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 15:01:32,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:32,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash 233143778, now seen corresponding path program 1 times [2025-02-05 15:01:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898845582] [2025-02-05 15:01:32,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:01:32,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:32,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:32,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898845582] [2025-02-05 15:01:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898845582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736498704] [2025-02-05 15:01:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:32,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:32,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:01:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:01:32,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:32,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:32,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:32,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:01:32,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:32,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736498704] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:32,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:32,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-05 15:01:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582784925] [2025-02-05 15:01:32,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:32,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:01:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:32,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:01:32,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:01:32,573 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:01:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:32,713 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2025-02-05 15:01:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:01:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2025-02-05 15:01:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:32,715 INFO L225 Difference]: With dead ends: 105 [2025-02-05 15:01:32,715 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 15:01:32,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:01:32,715 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:32,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 118 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 15:01:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2025-02-05 15:01:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:01:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-02-05 15:01:32,727 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 45 [2025-02-05 15:01:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:32,728 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-02-05 15:01:32,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:01:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-02-05 15:01:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:01:32,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:32,728 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:32,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:01:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:32,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -259133278, now seen corresponding path program 2 times [2025-02-05 15:01:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528893646] [2025-02-05 15:01:32,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:32,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-05 15:01:32,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:32,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:32,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528893646] [2025-02-05 15:01:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528893646] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512144082] [2025-02-05 15:01:32,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:32,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:32,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:32,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:01:33,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-05 15:01:33,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:33,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:33,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:33,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:01:33,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:01:33,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512144082] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:33,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-05 15:01:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939961124] [2025-02-05 15:01:33,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:33,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:01:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:33,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:01:33,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:01:33,086 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 15:01:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:33,152 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-02-05 15:01:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:01:33,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-02-05 15:01:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:33,154 INFO L225 Difference]: With dead ends: 120 [2025-02-05 15:01:33,154 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 15:01:33,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:01:33,154 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:33,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 15:01:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-02-05 15:01:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:01:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-02-05 15:01:33,166 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 45 [2025-02-05 15:01:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:33,166 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-02-05 15:01:33,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 15:01:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-02-05 15:01:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:01:33,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:33,167 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:33,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:01:33,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:33,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1958624675, now seen corresponding path program 3 times [2025-02-05 15:01:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490217197] [2025-02-05 15:01:33,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:33,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-02-05 15:01:33,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:33,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:01:33,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490217197] [2025-02-05 15:01:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490217197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087434684] [2025-02-05 15:01:33,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:33,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:33,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:33,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:01:33,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-02-05 15:01:33,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 45 statements. [2025-02-05 15:01:33,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:01:33,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:33,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 15:01:33,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:33,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:01:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087434684] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:34,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 29 [2025-02-05 15:01:34,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295587360] [2025-02-05 15:01:34,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:34,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 15:01:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:34,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 15:01:34,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-02-05 15:01:34,341 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-05 15:01:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:36,044 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2025-02-05 15:01:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 15:01:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2025-02-05 15:01:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:36,045 INFO L225 Difference]: With dead ends: 111 [2025-02-05 15:01:36,045 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 15:01:36,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 15:01:36,047 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:36,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 326 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:01:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 15:01:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2025-02-05 15:01:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:01:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-02-05 15:01:36,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 45 [2025-02-05 15:01:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-02-05 15:01:36,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-05 15:01:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-02-05 15:01:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:01:36,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:36,058 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:36,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:36,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:36,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:36,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash 50488643, now seen corresponding path program 2 times [2025-02-05 15:01:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:36,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113008509] [2025-02-05 15:01:36,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:36,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:36,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 15:01:36,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:01:36,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:36,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113008509] [2025-02-05 15:01:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113008509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662445778] [2025-02-05 15:01:36,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:36,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:36,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:36,434 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:36,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:01:36,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 15:01:36,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:01:36,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:36,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:36,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:01:36,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:36,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662445778] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:36,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-05 15:01:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612192709] [2025-02-05 15:01:36,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:36,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:01:36,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:36,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:01:36,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:01:36,605 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 15:01:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:36,720 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2025-02-05 15:01:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:01:36,721 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 49 [2025-02-05 15:01:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:36,723 INFO L225 Difference]: With dead ends: 140 [2025-02-05 15:01:36,723 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 15:01:36,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:01:36,724 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:36,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 148 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 15:01:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-05 15:01:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 108 states have internal predecessors, (121), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:01:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2025-02-05 15:01:36,753 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 49 [2025-02-05 15:01:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:36,753 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2025-02-05 15:01:36,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 15:01:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2025-02-05 15:01:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:01:36,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:36,754 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:36,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:36,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:01:36,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:36,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1772336621, now seen corresponding path program 3 times [2025-02-05 15:01:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443218037] [2025-02-05 15:01:36,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:36,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-02-05 15:01:37,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:01:37,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-05 15:01:37,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 15:01:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443218037] [2025-02-05 15:01:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443218037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532650325] [2025-02-05 15:01:37,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:37,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:37,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:37,582 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:37,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:01:37,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-02-05 15:01:37,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 109 statements. [2025-02-05 15:01:37,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:01:37,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:37,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 15:01:37,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-05 15:01:38,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-05 15:01:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532650325] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:38,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:38,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2025-02-05 15:01:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738744745] [2025-02-05 15:01:38,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:38,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-05 15:01:38,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:38,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-05 15:01:38,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1391, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 15:01:38,674 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 41 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 38 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:01:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:41,935 INFO L93 Difference]: Finished difference Result 260 states and 287 transitions. [2025-02-05 15:01:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2025-02-05 15:01:41,935 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 38 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 109 [2025-02-05 15:01:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:41,937 INFO L225 Difference]: With dead ends: 260 [2025-02-05 15:01:41,937 INFO L226 Difference]: Without dead ends: 250 [2025-02-05 15:01:41,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6624 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2645, Invalid=18525, Unknown=0, NotChecked=0, Total=21170 [2025-02-05 15:01:41,945 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 311 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:41,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 127 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:01:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-05 15:01:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2025-02-05 15:01:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 191 states have (on average 1.1204188481675392) internal successors, (214), 191 states have internal predecessors, (214), 25 states have call successors, (25), 22 states have call predecessors, (25), 21 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 15:01:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 263 transitions. [2025-02-05 15:01:42,006 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 263 transitions. Word has length 109 [2025-02-05 15:01:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:42,006 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 263 transitions. [2025-02-05 15:01:42,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 38 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:01:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 263 transitions. [2025-02-05 15:01:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:01:42,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:42,007 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:42,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:01:42,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:01:42,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:42,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1309952116, now seen corresponding path program 1 times [2025-02-05 15:01:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999470660] [2025-02-05 15:01:42,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:42,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:01:42,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:01:42,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:42,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:01:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999470660] [2025-02-05 15:01:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999470660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853875781] [2025-02-05 15:01:42,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:42,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:42,662 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:42,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:01:42,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:01:42,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:01:42,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:42,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:42,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 15:01:42,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:42,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:01:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853875781] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:43,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 30 [2025-02-05 15:01:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605415535] [2025-02-05 15:01:43,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 15:01:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:43,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 15:01:43,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2025-02-05 15:01:43,137 INFO L87 Difference]: Start difference. First operand 238 states and 263 transitions. Second operand has 30 states, 30 states have (on average 5.4) internal successors, (162), 30 states have internal predecessors, (162), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2025-02-05 15:01:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:43,574 INFO L93 Difference]: Finished difference Result 507 states and 570 transitions. [2025-02-05 15:01:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 15:01:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.4) internal successors, (162), 30 states have internal predecessors, (162), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 119 [2025-02-05 15:01:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:43,576 INFO L225 Difference]: With dead ends: 507 [2025-02-05 15:01:43,576 INFO L226 Difference]: Without dead ends: 501 [2025-02-05 15:01:43,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=966, Invalid=1686, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 15:01:43,577 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 158 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:43,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 246 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-05 15:01:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 498. [2025-02-05 15:01:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 399 states have (on average 1.1228070175438596) internal successors, (448), 399 states have internal predecessors, (448), 51 states have call successors, (51), 48 states have call predecessors, (51), 47 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 15:01:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 549 transitions. [2025-02-05 15:01:43,639 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 549 transitions. Word has length 119 [2025-02-05 15:01:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:43,639 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 549 transitions. [2025-02-05 15:01:43,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.4) internal successors, (162), 30 states have internal predecessors, (162), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2025-02-05 15:01:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 549 transitions. [2025-02-05 15:01:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 15:01:43,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:43,642 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:43,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:43,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:43,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:43,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash -464981596, now seen corresponding path program 2 times [2025-02-05 15:01:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567484980] [2025-02-05 15:01:43,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:43,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-02-05 15:01:43,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 15:01:43,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:43,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 15:01:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567484980] [2025-02-05 15:01:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567484980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158622277] [2025-02-05 15:01:44,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:44,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:44,884 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:44,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:01:44,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-02-05 15:01:44,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 15:01:44,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:44,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 15:01:44,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:45,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 15:01:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158622277] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:46,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 28] total 57 [2025-02-05 15:01:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250603336] [2025-02-05 15:01:46,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:46,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-05 15:01:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:46,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-05 15:01:46,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1466, Invalid=1726, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 15:01:46,087 INFO L87 Difference]: Start difference. First operand 498 states and 549 transitions. Second operand has 57 states, 57 states have (on average 5.842105263157895) internal successors, (333), 57 states have internal predecessors, (333), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2025-02-05 15:01:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:47,292 INFO L93 Difference]: Finished difference Result 1027 states and 1155 transitions. [2025-02-05 15:01:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-02-05 15:01:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.842105263157895) internal successors, (333), 57 states have internal predecessors, (333), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 249 [2025-02-05 15:01:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:47,300 INFO L225 Difference]: With dead ends: 1027 [2025-02-05 15:01:47,303 INFO L226 Difference]: Without dead ends: 1021 [2025-02-05 15:01:47,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4035, Invalid=6885, Unknown=0, NotChecked=0, Total=10920 [2025-02-05 15:01:47,310 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 336 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:47,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 418 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:01:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-05 15:01:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1018. [2025-02-05 15:01:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 815 states have (on average 1.123926380368098) internal successors, (916), 815 states have internal predecessors, (916), 103 states have call successors, (103), 100 states have call predecessors, (103), 99 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:01:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1121 transitions. [2025-02-05 15:01:47,430 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1121 transitions. Word has length 249 [2025-02-05 15:01:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:47,430 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1121 transitions. [2025-02-05 15:01:47,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.842105263157895) internal successors, (333), 57 states have internal predecessors, (333), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2025-02-05 15:01:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1121 transitions. [2025-02-05 15:01:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-02-05 15:01:47,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:47,442 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:47,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 15:01:47,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:47,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:47,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1500902356, now seen corresponding path program 3 times [2025-02-05 15:01:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859459531] [2025-02-05 15:01:47,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:47,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 509 statements into 51 equivalence classes. [2025-02-05 15:01:47,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 509 of 509 statements. [2025-02-05 15:01:47,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-02-05 15:01:47,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 7450 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 15:01:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859459531] [2025-02-05 15:01:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859459531] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367917300] [2025-02-05 15:01:54,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:54,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:54,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:54,313 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:54,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:01:54,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 509 statements into 51 equivalence classes. [2025-02-05 15:01:54,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 509 of 509 statements. [2025-02-05 15:01:54,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-02-05 15:01:54,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:54,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-05 15:01:54,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 12350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:55,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 100 proven. 7450 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-05 15:01:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367917300] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:59,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 53, 54] total 146 [2025-02-05 15:01:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722860408] [2025-02-05 15:01:59,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2025-02-05 15:01:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:59,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2025-02-05 15:01:59,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9196, Invalid=11974, Unknown=0, NotChecked=0, Total=21170 [2025-02-05 15:01:59,385 INFO L87 Difference]: Start difference. First operand 1018 states and 1121 transitions. Second operand has 146 states, 146 states have (on average 5.102739726027397) internal successors, (745), 146 states have internal predecessors, (745), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2025-02-05 15:02:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:04,493 INFO L93 Difference]: Finished difference Result 2027 states and 2279 transitions. [2025-02-05 15:02:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2025-02-05 15:02:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 146 states have (on average 5.102739726027397) internal successors, (745), 146 states have internal predecessors, (745), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) Word has length 509 [2025-02-05 15:02:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:04,509 INFO L225 Difference]: With dead ends: 2027 [2025-02-05 15:02:04,509 INFO L226 Difference]: Without dead ends: 2021 [2025-02-05 15:02:04,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 965 SyntacticMatches, 2 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4978 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15560, Invalid=26260, Unknown=0, NotChecked=0, Total=41820 [2025-02-05 15:02:04,516 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 830 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:04,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 799 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:02:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2025-02-05 15:02:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2018. [2025-02-05 15:02:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1615 states have (on average 1.1244582043343654) internal successors, (1816), 1615 states have internal predecessors, (1816), 203 states have call successors, (203), 200 states have call predecessors, (203), 199 states have return successors, (202), 202 states have call predecessors, (202), 202 states have call successors, (202) [2025-02-05 15:02:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2221 transitions. [2025-02-05 15:02:04,744 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2221 transitions. Word has length 509 [2025-02-05 15:02:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:04,745 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 2221 transitions. [2025-02-05 15:02:04,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 5.102739726027397) internal successors, (745), 146 states have internal predecessors, (745), 100 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (149), 99 states have call predecessors, (149), 99 states have call successors, (149) [2025-02-05 15:02:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2221 transitions. [2025-02-05 15:02:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2025-02-05 15:02:04,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:04,769 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:04,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:02:04,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:02:04,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 817226052, now seen corresponding path program 4 times [2025-02-05 15:02:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664144580] [2025-02-05 15:02:04,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:02:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:05,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1009 statements into 2 equivalence classes. [2025-02-05 15:02:05,642 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1009 of 1009 statements. [2025-02-05 15:02:05,642 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:02:05,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354207137] [2025-02-05 15:02:05,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:02:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:05,652 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:02:05,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:02:05,755 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1009 statements into 2 equivalence classes. [2025-02-05 15:02:06,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1009 of 1009 statements. [2025-02-05 15:02:06,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:02:06,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:02:06,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:02:06,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1009 statements into 1 equivalence classes. [2025-02-05 15:02:06,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1009 of 1009 statements. [2025-02-05 15:02:06,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:06,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:02:07,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:02:07,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:02:07,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:02:07,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-05 15:02:07,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:02:07,286 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:07,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:02:07,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:02:07 BoogieIcfgContainer [2025-02-05 15:02:07,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:02:07,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:02:07,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:02:07,486 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:02:07,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:01:27" (3/4) ... [2025-02-05 15:02:07,486 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:02:07,650 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 705. [2025-02-05 15:02:07,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:02:07,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:02:07,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:02:07,820 INFO L158 Benchmark]: Toolchain (without parser) took 40629.86ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 131.6MB in the beginning and 863.8MB in the end (delta: -732.2MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. [2025-02-05 15:02:07,821 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:02:07,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.61ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 120.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:07,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.17ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 119.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:07,821 INFO L158 Benchmark]: Boogie Preprocessor took 20.42ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 118.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:02:07,822 INFO L158 Benchmark]: IcfgBuilder took 208.52ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 106.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:07,822 INFO L158 Benchmark]: TraceAbstraction took 39891.30ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 106.0MB in the beginning and 926.7MB in the end (delta: -820.7MB). Peak memory consumption was 611.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:07,822 INFO L158 Benchmark]: Witness Printer took 334.57ms. Allocated memory is still 1.0GB. Free memory was 926.7MB in the beginning and 863.8MB in the end (delta: 62.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-05 15:02:07,823 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.18ms. Allocated memory is still 226.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.61ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 120.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.17ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 119.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.42ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 118.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 208.52ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 106.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 39891.30ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 106.0MB in the beginning and 926.7MB in the end (delta: -820.7MB). Peak memory consumption was 611.4MB. Max. memory is 16.1GB. * Witness Printer took 334.57ms. Allocated memory is still 1.0GB. Free memory was 926.7MB in the beginning and 863.8MB in the end (delta: 62.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=199, Y=1, counter=0, v=-197, x=0, y=0] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=1, v=-197, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=1, v=-195, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=199, Y=1, counter=1, v=-195, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=2, v=-193, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=199, Y=1, counter=2, v=-193, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=3, v=-191, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=199, Y=1, counter=3, v=-191, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=4, v=-189, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=199, Y=1, counter=4, v=-189, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=5, v=-187, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=199, Y=1, counter=5, v=-187, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=6, v=-185, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=199, Y=1, counter=6, v=-185, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=7, v=-183, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=199, Y=1, counter=7, v=-183, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=8, v=-181, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=199, Y=1, counter=8, v=-181, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=9, v=-179, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=199, Y=1, counter=9, v=-179, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=10, v=-177, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=199, Y=1, counter=10, v=-177, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=11, v=-175, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=199, Y=1, counter=11, v=-175, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=12, v=-173, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=199, Y=1, counter=12, v=-173, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=13, v=-171, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=199, Y=1, counter=13, v=-171, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=14, v=-169, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=199, Y=1, counter=14, v=-169, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=15, v=-167, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=199, Y=1, counter=15, v=-167, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=16, v=-165, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=199, Y=1, counter=16, v=-165, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=17, v=-163, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=199, Y=1, counter=17, v=-163, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=18, v=-161, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=199, Y=1, counter=18, v=-161, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=19, v=-159, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=199, Y=1, counter=19, v=-159, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=20, v=-157, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=199, Y=1, counter=20, v=-157, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=21, v=-155, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=199, Y=1, counter=21, v=-155, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=22, v=-153, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=199, Y=1, counter=22, v=-153, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=23, v=-151, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=199, Y=1, counter=23, v=-151, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=24, v=-149, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=199, Y=1, counter=24, v=-149, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=25, v=-147, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=199, Y=1, counter=25, v=-147, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=26, v=-145, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=199, Y=1, counter=26, v=-145, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=27, v=-143, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=199, Y=1, counter=27, v=-143, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=28, v=-141, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=199, Y=1, counter=28, v=-141, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=29, v=-139, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=199, Y=1, counter=29, v=-139, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=30, v=-137, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=199, Y=1, counter=30, v=-137, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=31, v=-135, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=199, Y=1, counter=31, v=-135, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=32, v=-133, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=199, Y=1, counter=32, v=-133, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=33, v=-131, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=199, Y=1, counter=33, v=-131, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=34, v=-129, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=199, Y=1, counter=34, v=-129, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=35, v=-127, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=199, Y=1, counter=35, v=-127, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=36, v=-125, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=199, Y=1, counter=36, v=-125, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=37, v=-123, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=199, Y=1, counter=37, v=-123, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=38, v=-121, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=199, Y=1, counter=38, v=-121, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=39, v=-119, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=199, Y=1, counter=39, v=-119, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=40, v=-117, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=199, Y=1, counter=40, v=-117, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=41, v=-115, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=199, Y=1, counter=41, v=-115, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=42, v=-113, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=199, Y=1, counter=42, v=-113, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=43, v=-111, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=199, Y=1, counter=43, v=-111, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=44, v=-109, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=199, Y=1, counter=44, v=-109, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=45, v=-107, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=199, Y=1, counter=45, v=-107, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=46, v=-105, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=199, Y=1, counter=46, v=-105, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=47, v=-103, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=199, Y=1, counter=47, v=-103, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=48, v=-101, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=199, Y=1, counter=48, v=-101, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=49, v=-99, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=199, Y=1, counter=49, v=-99, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=50, v=-97, x=49, xy=0, y=0, yx=49] [L45] x++ VAL [X=199, Y=1, counter=50, v=-97, x=50, xy=0, y=0, yx=49] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=49] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=51, v=-95, x=50, xy=0, y=0, yx=50] [L45] x++ VAL [X=199, Y=1, counter=51, v=-95, x=51, xy=0, y=0, yx=50] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=50] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=52, v=-93, x=51, xy=0, y=0, yx=51] [L45] x++ VAL [X=199, Y=1, counter=52, v=-93, x=52, xy=0, y=0, yx=51] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=51] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=53, v=-91, x=52, xy=0, y=0, yx=52] [L45] x++ VAL [X=199, Y=1, counter=53, v=-91, x=53, xy=0, y=0, yx=52] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=52] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=54, v=-89, x=53, xy=0, y=0, yx=53] [L45] x++ VAL [X=199, Y=1, counter=54, v=-89, x=54, xy=0, y=0, yx=53] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=53] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=55, v=-87, x=54, xy=0, y=0, yx=54] [L45] x++ VAL [X=199, Y=1, counter=55, v=-87, x=55, xy=0, y=0, yx=54] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=54] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=56, v=-85, x=55, xy=0, y=0, yx=55] [L45] x++ VAL [X=199, Y=1, counter=56, v=-85, x=56, xy=0, y=0, yx=55] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=55] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=57, v=-83, x=56, xy=0, y=0, yx=56] [L45] x++ VAL [X=199, Y=1, counter=57, v=-83, x=57, xy=0, y=0, yx=56] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=56] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=58, v=-81, x=57, xy=0, y=0, yx=57] [L45] x++ VAL [X=199, Y=1, counter=58, v=-81, x=58, xy=0, y=0, yx=57] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=57] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=59, v=-79, x=58, xy=0, y=0, yx=58] [L45] x++ VAL [X=199, Y=1, counter=59, v=-79, x=59, xy=0, y=0, yx=58] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=58] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=60, v=-77, x=59, xy=0, y=0, yx=59] [L45] x++ VAL [X=199, Y=1, counter=60, v=-77, x=60, xy=0, y=0, yx=59] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=59] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=61, v=-75, x=60, xy=0, y=0, yx=60] [L45] x++ VAL [X=199, Y=1, counter=61, v=-75, x=61, xy=0, y=0, yx=60] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=60] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=62, v=-73, x=61, xy=0, y=0, yx=61] [L45] x++ VAL [X=199, Y=1, counter=62, v=-73, x=62, xy=0, y=0, yx=61] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=61] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=63, v=-71, x=62, xy=0, y=0, yx=62] [L45] x++ VAL [X=199, Y=1, counter=63, v=-71, x=63, xy=0, y=0, yx=62] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=62] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=64, v=-69, x=63, xy=0, y=0, yx=63] [L45] x++ VAL [X=199, Y=1, counter=64, v=-69, x=64, xy=0, y=0, yx=63] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=63] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=65, v=-67, x=64, xy=0, y=0, yx=64] [L45] x++ VAL [X=199, Y=1, counter=65, v=-67, x=65, xy=0, y=0, yx=64] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=64] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=66, v=-65, x=65, xy=0, y=0, yx=65] [L45] x++ VAL [X=199, Y=1, counter=66, v=-65, x=66, xy=0, y=0, yx=65] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=65] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=67, v=-63, x=66, xy=0, y=0, yx=66] [L45] x++ VAL [X=199, Y=1, counter=67, v=-63, x=67, xy=0, y=0, yx=66] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=66] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=68, v=-61, x=67, xy=0, y=0, yx=67] [L45] x++ VAL [X=199, Y=1, counter=68, v=-61, x=68, xy=0, y=0, yx=67] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=67] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=69, v=-59, x=68, xy=0, y=0, yx=68] [L45] x++ VAL [X=199, Y=1, counter=69, v=-59, x=69, xy=0, y=0, yx=68] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=68] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=70, v=-57, x=69, xy=0, y=0, yx=69] [L45] x++ VAL [X=199, Y=1, counter=70, v=-57, x=70, xy=0, y=0, yx=69] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=69] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=71, v=-55, x=70, xy=0, y=0, yx=70] [L45] x++ VAL [X=199, Y=1, counter=71, v=-55, x=71, xy=0, y=0, yx=70] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=70] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=72, v=-53, x=71, xy=0, y=0, yx=71] [L45] x++ VAL [X=199, Y=1, counter=72, v=-53, x=72, xy=0, y=0, yx=71] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=71] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=73, v=-51, x=72, xy=0, y=0, yx=72] [L45] x++ VAL [X=199, Y=1, counter=73, v=-51, x=73, xy=0, y=0, yx=72] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=72] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=74, v=-49, x=73, xy=0, y=0, yx=73] [L45] x++ VAL [X=199, Y=1, counter=74, v=-49, x=74, xy=0, y=0, yx=73] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=73] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=75, v=-47, x=74, xy=0, y=0, yx=74] [L45] x++ VAL [X=199, Y=1, counter=75, v=-47, x=75, xy=0, y=0, yx=74] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=74] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=76, v=-45, x=75, xy=0, y=0, yx=75] [L45] x++ VAL [X=199, Y=1, counter=76, v=-45, x=76, xy=0, y=0, yx=75] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=75] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=77, v=-43, x=76, xy=0, y=0, yx=76] [L45] x++ VAL [X=199, Y=1, counter=77, v=-43, x=77, xy=0, y=0, yx=76] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=76] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=78, v=-41, x=77, xy=0, y=0, yx=77] [L45] x++ VAL [X=199, Y=1, counter=78, v=-41, x=78, xy=0, y=0, yx=77] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=77] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=79, v=-39, x=78, xy=0, y=0, yx=78] [L45] x++ VAL [X=199, Y=1, counter=79, v=-39, x=79, xy=0, y=0, yx=78] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=78] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=80, v=-37, x=79, xy=0, y=0, yx=79] [L45] x++ VAL [X=199, Y=1, counter=80, v=-37, x=80, xy=0, y=0, yx=79] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=79] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=81, v=-35, x=80, xy=0, y=0, yx=80] [L45] x++ VAL [X=199, Y=1, counter=81, v=-35, x=81, xy=0, y=0, yx=80] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=80] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=82, v=-33, x=81, xy=0, y=0, yx=81] [L45] x++ VAL [X=199, Y=1, counter=82, v=-33, x=82, xy=0, y=0, yx=81] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=81] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=83, v=-31, x=82, xy=0, y=0, yx=82] [L45] x++ VAL [X=199, Y=1, counter=83, v=-31, x=83, xy=0, y=0, yx=82] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=82] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=84, v=-29, x=83, xy=0, y=0, yx=83] [L45] x++ VAL [X=199, Y=1, counter=84, v=-29, x=84, xy=0, y=0, yx=83] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=83] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=85, v=-27, x=84, xy=0, y=0, yx=84] [L45] x++ VAL [X=199, Y=1, counter=85, v=-27, x=85, xy=0, y=0, yx=84] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=84] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=86, v=-25, x=85, xy=0, y=0, yx=85] [L45] x++ VAL [X=199, Y=1, counter=86, v=-25, x=86, xy=0, y=0, yx=85] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=85] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=87, v=-23, x=86, xy=0, y=0, yx=86] [L45] x++ VAL [X=199, Y=1, counter=87, v=-23, x=87, xy=0, y=0, yx=86] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=86] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=88, v=-21, x=87, xy=0, y=0, yx=87] [L45] x++ VAL [X=199, Y=1, counter=88, v=-21, x=88, xy=0, y=0, yx=87] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=87] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=89, v=-19, x=88, xy=0, y=0, yx=88] [L45] x++ VAL [X=199, Y=1, counter=89, v=-19, x=89, xy=0, y=0, yx=88] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=88] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=90, v=-17, x=89, xy=0, y=0, yx=89] [L45] x++ VAL [X=199, Y=1, counter=90, v=-17, x=90, xy=0, y=0, yx=89] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=89] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=91, v=-15, x=90, xy=0, y=0, yx=90] [L45] x++ VAL [X=199, Y=1, counter=91, v=-15, x=91, xy=0, y=0, yx=90] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=90] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=92, v=-13, x=91, xy=0, y=0, yx=91] [L45] x++ VAL [X=199, Y=1, counter=92, v=-13, x=92, xy=0, y=0, yx=91] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=91] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=93, v=-11, x=92, xy=0, y=0, yx=92] [L45] x++ VAL [X=199, Y=1, counter=93, v=-11, x=93, xy=0, y=0, yx=92] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=92] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=94, v=-9, x=93, xy=0, y=0, yx=93] [L45] x++ VAL [X=199, Y=1, counter=94, v=-9, x=94, xy=0, y=0, yx=93] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=93] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=95, v=-7, x=94, xy=0, y=0, yx=94] [L45] x++ VAL [X=199, Y=1, counter=95, v=-7, x=95, xy=0, y=0, yx=94] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=94] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=96, v=-5, x=95, xy=0, y=0, yx=95] [L45] x++ VAL [X=199, Y=1, counter=96, v=-5, x=96, xy=0, y=0, yx=95] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=95] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=97, v=-3, x=96, xy=0, y=0, yx=96] [L45] x++ VAL [X=199, Y=1, counter=97, v=-3, x=97, xy=0, y=0, yx=96] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=96] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=98, v=-1, x=97, xy=0, y=0, yx=97] [L45] x++ VAL [X=199, Y=1, counter=98, v=-1, x=98, xy=0, y=0, yx=97] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=97] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, counter=99, v=1, x=98, xy=0, y=0, yx=98] [L45] x++ VAL [X=199, Y=1, counter=99, v=1, x=99, xy=0, y=0, yx=98] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=98] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=199, Y=1, counter=100, v=-395, x=99, xy=0, y=1, yx=99] [L45] x++ VAL [X=199, Y=1, counter=100, v=-395, x=100, xy=0, y=1, yx=99] [L31] COND TRUE counter++<100 [L31] EXPR counter++ VAL [X=199, Y=1, counter=101, v=-395, x=100, xy=0, y=1, yx=99] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=199, Y=1, counter=101, v=-395, xy=100, y=1, yx=100] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.7s, OverallIterations: 17, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1819 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1816 mSDsluCounter, 2848 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2658 IncrementalHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 245 mSDtfsCounter, 2658 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3010 GetRequests, 2318 SyntacticMatches, 15 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15097 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2018occurred in iteration=16, InterpolantAutomatonStates: 635, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 4595 NumberOfCodeBlocks, 4485 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 3706 ConstructedInterpolants, 6 QuantifiedInterpolants, 11535 SizeOfPredicates, 124 NumberOfNonLiveVariables, 3234 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 37 InterpolantComputations, 4 PerfectInterpolantSequences, 14591/50028 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:02:07,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE