./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:03:12,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:03:12,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:03:12,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:03:12,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:03:12,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:03:12,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:03:12,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:03:12,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:03:12,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:03:12,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:03:12,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:03:12,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:03:12,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:03:12,410 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:03:12,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:03:12,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:03:12,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:03:12,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:03:12,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:03:12,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:03:12,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:03:12,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:03:12,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:03:12,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:03:12,412 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb [2025-02-07 23:03:12,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:03:12,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:03:12,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:03:12,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:03:12,669 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:03:12,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2025-02-07 23:03:13,779 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c722cfd96/107116d44dad449ab7ffa548dc6a43d1/FLAG20866352d [2025-02-07 23:03:13,991 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:03:13,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2025-02-07 23:03:14,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c722cfd96/107116d44dad449ab7ffa548dc6a43d1/FLAG20866352d [2025-02-07 23:03:14,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c722cfd96/107116d44dad449ab7ffa548dc6a43d1 [2025-02-07 23:03:14,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:03:14,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:03:14,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:03:14,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:03:14,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:03:14,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c38a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14, skipping insertion in model container [2025-02-07 23:03:14,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:03:14,459 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c[1249,1262] [2025-02-07 23:03:14,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:03:14,533 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:03:14,539 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c[1249,1262] [2025-02-07 23:03:14,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:03:14,592 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:03:14,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14 WrapperNode [2025-02-07 23:03:14,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:03:14,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:03:14,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:03:14,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:03:14,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,659 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2025-02-07 23:03:14,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:03:14,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:03:14,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:03:14,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:03:14,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,693 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-07 23:03:14,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:03:14,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:03:14,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:03:14,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:03:14,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (1/1) ... [2025-02-07 23:03:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:03:14,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:14,769 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-07 23:03:14,781 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-07 23:03:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:03:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:03:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:03:14,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:03:14,878 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:03:14,880 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:03:15,451 INFO L? ?]: Removed 258 outVars from TransFormulas that were not future-live. [2025-02-07 23:03:15,451 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:03:15,489 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:03:15,489 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:03:15,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:03:15 BoogieIcfgContainer [2025-02-07 23:03:15,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:03:15,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:03:15,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:03:15,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:03:15,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:03:14" (1/3) ... [2025-02-07 23:03:15,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cb0053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:03:15, skipping insertion in model container [2025-02-07 23:03:15,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:14" (2/3) ... [2025-02-07 23:03:15,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cb0053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:03:15, skipping insertion in model container [2025-02-07 23:03:15,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:03:15" (3/3) ... [2025-02-07 23:03:15,498 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v6.c [2025-02-07 23:03:15,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:03:15,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v6.c that has 1 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:03:15,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:03:15,565 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;@57c0a5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:03:15,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:03:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.5) internal successors, (189), 127 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 23:03:15,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:15,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:03:15,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1663279422, now seen corresponding path program 1 times [2025-02-07 23:03:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:03:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889342821] [2025-02-07 23:03:15,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:03:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:03:15,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-07 23:03:15,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 23:03:15,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:15,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:16,226 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-07 23:03:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:03:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889342821] [2025-02-07 23:03:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889342821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:03:16,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:03:16,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:03:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664008478] [2025-02-07 23:03:16,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:03:16,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:03:16,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:03:16,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:03:16,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:03:16,249 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.5) internal successors, (189), 127 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:16,362 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-02-07 23:03:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:03:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-07 23:03:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:16,369 INFO L225 Difference]: With dead ends: 175 [2025-02-07 23:03:16,370 INFO L226 Difference]: Without dead ends: 128 [2025-02-07 23:03:16,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-07 23:03:16,373 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:16,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:03:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-07 23:03:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-07 23:03:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2025-02-07 23:03:16,395 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 54 [2025-02-07 23:03:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:16,396 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2025-02-07 23:03:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2025-02-07 23:03:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 23:03:16,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:16,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:03:16,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:03:16,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash -17375352, now seen corresponding path program 1 times [2025-02-07 23:03:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:03:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528681865] [2025-02-07 23:03:16,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:03:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:03:16,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 23:03:16,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 23:03:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:16,588 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-07 23:03:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:03:16,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528681865] [2025-02-07 23:03:16,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528681865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:03:16,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:03:16,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:03:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000479685] [2025-02-07 23:03:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:03:16,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:03:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:03:16,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:03:16,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:03:16,590 INFO L87 Difference]: Start difference. First operand 128 states and 188 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:16,671 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2025-02-07 23:03:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:03:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-07 23:03:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:16,672 INFO L225 Difference]: With dead ends: 177 [2025-02-07 23:03:16,672 INFO L226 Difference]: Without dead ends: 130 [2025-02-07 23:03:16,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-07 23:03:16,673 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:16,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:03:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-07 23:03:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-07 23:03:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 129 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-02-07 23:03:16,678 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 55 [2025-02-07 23:03:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-02-07 23:03:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-02-07 23:03:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 23:03:16,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:16,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:03:16,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:03:16,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:16,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1392873341, now seen corresponding path program 1 times [2025-02-07 23:03:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:03:16,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651658385] [2025-02-07 23:03:16,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:03:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:03:16,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 23:03:16,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 23:03:16,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:16,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:16,982 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-07 23:03:16,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:03:16,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651658385] [2025-02-07 23:03:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651658385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:03:16,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:03:16,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:03:16,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150759478] [2025-02-07 23:03:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:03:16,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:03:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:03:16,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:03:16,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:03:16,984 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:17,058 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2025-02-07 23:03:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:03:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-07 23:03:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:17,059 INFO L225 Difference]: With dead ends: 177 [2025-02-07 23:03:17,059 INFO L226 Difference]: Without dead ends: 128 [2025-02-07 23:03:17,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:03:17,060 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 138 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:17,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 296 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:03:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-07 23:03:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-07 23:03:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 127 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-02-07 23:03:17,067 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 56 [2025-02-07 23:03:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-02-07 23:03:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-02-07 23:03:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-07 23:03:17,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:17,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:03:17,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:03:17,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:17,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash 399665503, now seen corresponding path program 1 times [2025-02-07 23:03:17,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:03:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128239918] [2025-02-07 23:03:17,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:03:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:03:17,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-07 23:03:17,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-07 23:03:17,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:17,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:03:17,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:03:17,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-07 23:03:17,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-07 23:03:17,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:17,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:03:17,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:03:17,191 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:03:17,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:03:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:03:17,195 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 23:03:17,214 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:17,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:03:17,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:03:17 BoogieIcfgContainer [2025-02-07 23:03:17,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:03:17,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:03:17,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:03:17,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:03:17,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:03:15" (3/4) ... [2025-02-07 23:03:17,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:03:17,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:03:17,226 INFO L158 Benchmark]: Toolchain (without parser) took 2883.23ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 114.3MB in the beginning and 120.8MB in the end (delta: -6.5MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2025-02-07 23:03:17,227 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:03:17,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.70ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 95.5MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:03:17,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.21ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 83.8MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:03:17,227 INFO L158 Benchmark]: Boogie Preprocessor took 72.35ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 76.6MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:03:17,228 INFO L158 Benchmark]: IcfgBuilder took 756.78ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.1MB in the end (delta: 6.5MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2025-02-07 23:03:17,228 INFO L158 Benchmark]: TraceAbstraction took 1730.76ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.4MB in the beginning and 120.8MB in the end (delta: -51.5MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2025-02-07 23:03:17,228 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 285.2MB. Free memory was 120.8MB in the beginning and 120.8MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:03:17,229 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 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.70ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 95.5MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.21ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 83.8MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.35ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 76.6MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 756.78ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.1MB in the end (delta: 6.5MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1730.76ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.4MB in the beginning and 120.8MB in the end (delta: -51.5MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 285.2MB. Free memory was 120.8MB in the beginning and 120.8MB in the end (delta: 24.0kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 155. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_22 = 0; [L34] const SORT_5 var_31 = 1; [L35] const SORT_1 var_109 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_35; [L44] SORT_5 input_37; [L45] SORT_5 input_39; [L46] SORT_5 input_51; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L48] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L49] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L50] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L51] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L52] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L53] SORT_5 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L54] SORT_5 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L55] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L56] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L57] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L58] SORT_5 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L59] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L60] SORT_5 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L61] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L62] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L63] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L64] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L65] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L66] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L67] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_11_arg_1 = var_9; [L70] state_10 = init_11_arg_1 [L71] SORT_1 init_13_arg_1 = var_9; [L72] state_12 = init_13_arg_1 [L73] SORT_1 init_19_arg_1 = var_9; [L74] state_18 = init_19_arg_1 [L75] SORT_5 init_24_arg_1 = var_22; [L76] state_23 = init_24_arg_1 [L77] SORT_1 init_27_arg_1 = var_9; [L78] state_26 = init_27_arg_1 [L79] SORT_5 init_42_arg_1 = var_22; [L80] state_41 = init_42_arg_1 [L81] SORT_5 init_44_arg_1 = var_22; [L82] state_43 = init_44_arg_1 [L83] SORT_1 init_46_arg_1 = var_9; [L84] state_45 = init_46_arg_1 [L85] SORT_1 init_48_arg_1 = var_9; [L86] state_47 = init_48_arg_1 [L87] SORT_1 init_50_arg_1 = var_9; [L88] state_49 = init_50_arg_1 [L89] SORT_5 init_54_arg_1 = var_22; [L90] state_53 = init_54_arg_1 [L91] SORT_1 init_56_arg_1 = var_9; [L92] state_55 = init_56_arg_1 [L93] SORT_5 init_58_arg_1 = var_22; [L94] state_57 = init_58_arg_1 [L95] SORT_1 init_60_arg_1 = var_9; [L96] state_59 = init_60_arg_1 [L97] SORT_1 init_63_arg_1 = var_9; [L98] state_62 = init_63_arg_1 [L99] SORT_1 init_65_arg_1 = var_9; [L100] state_64 = init_65_arg_1 [L101] SORT_1 init_67_arg_1 = var_9; [L102] state_66 = init_67_arg_1 [L103] SORT_1 init_69_arg_1 = var_9; [L104] state_68 = init_69_arg_1 [L105] SORT_1 init_71_arg_1 = var_9; [L106] state_70 = init_71_arg_1 [L107] SORT_1 init_73_arg_1 = var_9; [L108] state_72 = init_73_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] EXPR input_8 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_16=0, var_22=0, var_31=1, var_9=0] [L126] EXPR var_16 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_25=0, var_31=1, var_9=0] [L147] EXPR var_25 & mask_SORT_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_9=0] [L155] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] EXPR var_33 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 1207 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 750 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 457 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2025-02-07 23:03:17,245 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:03:19,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:03:19,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:03:19,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:03:19,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:03:19,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:03:19,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:03:19,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:03:19,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:03:19,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:03:19,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:03:19,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:03:19,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:03:19,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:03:19,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:03:19,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:03:19,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:03:19,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:03:19,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:03:19,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:03:19,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:03:19,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:03:19,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:03:19,417 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb [2025-02-07 23:03:19,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:03:19,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:03:19,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:03:19,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:03:19,651 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:03:19,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2025-02-07 23:03:20,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0687388bc/9ecb850fd60c49bdb45169b75793d797/FLAG7eccbaf13 [2025-02-07 23:03:21,088 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:03:21,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2025-02-07 23:03:21,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0687388bc/9ecb850fd60c49bdb45169b75793d797/FLAG7eccbaf13 [2025-02-07 23:03:21,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0687388bc/9ecb850fd60c49bdb45169b75793d797 [2025-02-07 23:03:21,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:03:21,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:03:21,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:03:21,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:03:21,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:03:21,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f382d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21, skipping insertion in model container [2025-02-07 23:03:21,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:03:21,239 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c[1249,1262] [2025-02-07 23:03:21,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:03:21,308 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:03:21,318 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c[1249,1262] [2025-02-07 23:03:21,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:03:21,351 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:03:21,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21 WrapperNode [2025-02-07 23:03:21,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:03:21,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:03:21,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:03:21,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:03:21,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,387 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 358 [2025-02-07 23:03:21,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:03:21,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:03:21,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:03:21,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:03:21,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,415 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-07 23:03:21,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:03:21,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:03:21,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:03:21,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:03:21,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (1/1) ... [2025-02-07 23:03:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:03:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:21,476 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-07 23:03:21,479 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-07 23:03:21,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:03:21,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:03:21,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:03:21,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:03:21,615 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:03:21,617 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:03:21,821 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-02-07 23:03:21,822 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:03:21,827 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:03:21,828 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:03:21,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:03:21 BoogieIcfgContainer [2025-02-07 23:03:21,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:03:21,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:03:21,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:03:21,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:03:21,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:03:21" (1/3) ... [2025-02-07 23:03:21,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd34f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:03:21, skipping insertion in model container [2025-02-07 23:03:21,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:03:21" (2/3) ... [2025-02-07 23:03:21,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd34f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:03:21, skipping insertion in model container [2025-02-07 23:03:21,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:03:21" (3/3) ... [2025-02-07 23:03:21,835 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v6.c [2025-02-07 23:03:21,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:03:21,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v6.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:03:21,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:03:21,884 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;@71e5371b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:03:21,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:03:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:03:21,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:21,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:03:21,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:21,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:03:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:03:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302346123] [2025-02-07 23:03:21,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:03:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:21,907 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-07 23:03:21,922 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-07 23:03:22,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:03:22,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:03:22,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:22,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-07 23:03:22,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:03:22,317 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-07 23:03:22,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:03:22,318 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:03:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302346123] [2025-02-07 23:03:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302346123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:03:22,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:03:22,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:03:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255244429] [2025-02-07 23:03:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:03:22,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:03:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:03:22,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:03:22,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:03:22,336 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:22,363 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 23:03:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:03:22,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 23:03:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:22,369 INFO L225 Difference]: With dead ends: 15 [2025-02-07 23:03:22,369 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 23:03:22,371 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-07 23:03:22,373 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:22,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:03:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 23:03:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 23:03:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:03:22,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:03:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:03:22,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:03:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:03:22,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:22,394 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:03:22,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 23:03:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:22,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:22,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:03:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:03:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616910382] [2025-02-07 23:03:22,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:03:22,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:22,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:22,599 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-07 23:03:22,601 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-07 23:03:22,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:03:22,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:03:22,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:22,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:22,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-07 23:03:22,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:03:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:03:23,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:03:30,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse44 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_64~0#1|)))) (.cse39 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))) .cse44)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|))))) (let ((.cse9 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_43~0#1|))))))) (.cse40 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse32)) .cse44)) (_ bv0 8))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))) .cse44)) (_ bv0 8)))) (.cse38 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse46)))))))) (.cse37 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse45))))))) (.cse31 (not .cse39)) (.cse36 (bvneg .cse32)) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))) .cse44))))) (.cse17 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) .cse43)))))) (.cse15 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_72~0#1|)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|))))))))))))))) (.cse1 (not .cse17)) (.cse12 (or .cse40 (and (or .cse2 (and (or .cse38 .cse39) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse41))))))) .cse31))) (or (and (or .cse37 .cse39) (or .cse31 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse42)))))))) .cse7)))) (.cse13 (or (and (or .cse31 (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse32))))) .cse36))))))) (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse33 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse33)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse35))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse35)))))) .cse7)))) (or (and (or .cse7 .cse37) (or .cse2 .cse38)) .cse39)) (not .cse40))) (.cse8 (not .cse9)) (.cse21 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_59~0#1|)) (.cse20 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_55~0#1|)) (.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|))) (and (or .cse0 (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse21))))))))) (let ((.cse11 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))))))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))))))))) (and (or .cse1 (and (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse6)))))) .cse7)) .cse8) (or .cse9 (and (or .cse2 .cse10) (or .cse11 .cse7))))) .cse12 .cse13 (or (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))))))))) .cse8) (or .cse9 .cse11)) .cse7) (or (and (or .cse9 .cse10) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))))))))) .cse2)) .cse17))))) (or (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (bvneg .cse20)))))))))) (let ((.cse26 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse30)))))))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse29)))))))) (and (or (and (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse23)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse24)))))) .cse7)) .cse8) (or (and (or .cse7 .cse25) (or .cse2 .cse26)) .cse9)) .cse1) .cse12 .cse13 (or (and (or .cse2 (and (or .cse9 .cse26) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse27)))))))))) (or .cse7 (and (or .cse9 .cse25) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse28)))))))))) .cse17)))) (not .cse0))))))) is different from false [2025-02-07 23:03:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-07 23:03:37,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:03:37,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616910382] [2025-02-07 23:03:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616910382] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:03:37,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:03:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 23:03:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896125011] [2025-02-07 23:03:37,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:03:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:03:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:03:37,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:03:37,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2025-02-07 23:03:37,098 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:38,125 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 23:03:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:03:38,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:03:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:38,127 INFO L225 Difference]: With dead ends: 13 [2025-02-07 23:03:38,127 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 23:03:38,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=35, Invalid=78, Unknown=1, NotChecked=18, Total=132 [2025-02-07 23:03:38,129 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:38,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2025-02-07 23:03:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 23:03:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 23:03:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:03:38,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:03:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:38,137 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:03:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:03:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:03:38,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:38,138 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:03:38,146 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-07 23:03:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:38,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:03:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:03:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236755240] [2025-02-07 23:03:38,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:03:38,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:38,343 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-07 23:03:38,344 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-07 23:03:38,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 23:03:38,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:03:38,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:03:38,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:38,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-07 23:03:38,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:03:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:03:42,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:04:37,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse89 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|))))) (let ((.cse82 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_45~0#1|)) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_109~0#1|)) (.cse90 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse92 (bvneg .cse89))) (let ((.cse88 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse92 .cse89)))))) (.cse87 ((_ zero_extend 24) ((_ extract 7 0) .cse89))) (.cse12 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_15|)))) .cse90))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse82 .cse10)))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_15|)))) .cse90)))))) (let ((.cse55 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse103 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse103))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse103 .cse9))) .cse10)))) .cse12) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse104 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse104))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse104)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse9))) .cse10)))) .cse6))) (.cse5 (= ((_ extract 7 0) (bvand .cse87 .cse90)) (_ bv0 8))) (.cse95 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse88 .cse92)))))) (.cse2 (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse101 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse101))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse101)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse9))) .cse10)))))) (or (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse102))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse102))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse102 .cse9))) .cse10))))) .cse12))) (.cse13 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))) .cse90)))) (.cse85 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_62~0#1|))))))) (let ((.cse30 (= ((_ extract 7 0) (bvand .cse90 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_41~0#1|))))))) (_ bv0 8))) (.cse53 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse99 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse99))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse92))))) .cse99)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse9))) .cse10))))) .cse6) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse100))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse92))))) .cse100))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse100 .cse9))) .cse10))))) .cse12))) (.cse23 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse90 ((_ zero_extend 24) ((_ extract 7 0) .cse85)))))) (.cse20 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_70~0#1|))))))) (.cse84 (or .cse2 .cse13)) (.cse52 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse97 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse97))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse95 .cse97))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse9))) .cse10))))) .cse12) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse98 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse98))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse95 .cse98)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse9))) .cse10)))))))) (.cse83 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_47~0#1|)) (.cse63 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse94 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse94))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse95 .cse94)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse94 .cse9))) .cse10)))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse96 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse96))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse95 .cse96))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse96 .cse9))) .cse10)))) .cse12))) (.cse3 (not .cse5)) (.cse86 (or .cse55 .cse13)) (.cse62 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse91 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse91))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse92))))) .cse91))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse91 .cse9))) .cse10)))) .cse12) (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse93 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse93))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse92))))) .cse93)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse93 .cse9))) .cse10))))))) (.cse44 (not .cse13)) (.cse4 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse87)) .cse90)))) (.cse47 (bvneg .cse87)) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_49~0#1|)))) (.cse73 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_53~0#1|))) .cse90))))) (let ((.cse14 (not .cse73)) (.cse32 (bvneg .cse72)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul (_ bv2 32) .cse89)))))))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) .cse88))) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse87 .cse47))))) .cse47)))))) (.cse1 (not .cse4)) (.cse33 (or (and .cse86 (or .cse62 .cse44)) .cse5)) (.cse34 (or (and (or .cse63 .cse44) .cse86) .cse3)) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse82 (bvneg .cse83))))))))) (.cse15 (or (and .cse84 (or .cse52 .cse44)) .cse3)) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_66~0#1|)))))) .cse85))))) .cse20)))))) (.cse27 (not .cse23)) (.cse16 (or (and .cse84 (or .cse44 .cse53)) .cse5)) (.cse17 (not .cse30)) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse82 .cse83))))))))) (and (or (let ((.cse0 (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse8)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse9))) .cse10)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse11))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse11))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse9))) .cse10))))) .cse12)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 .cse0) (or .cse2 .cse5))) .cse13) (or .cse14 (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse32))))))))) (let ((.cse22 (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse28))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse28)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse9))) .cse10)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse29))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 .cse9))) .cse10))))) .cse12)) .cse30))) (and .cse15 .cse16 (or (and (or .cse17 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20)))))))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse9))) .cse10))))) .cse12) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse9))) .cse10)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20)))))))))))) .cse6))) .cse22) .cse23) (or (and .cse22 (or .cse17 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse25))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse9))) .cse10))))) .cse12) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse26))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse26)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse9))) .cse10))))) .cse6)))) .cse27))))) (or .cse14 (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse32))))))))) (let ((.cse38 (or .cse30 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse41)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse9))) .cse10)))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse42))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse9))) .cse10)))) .cse12))))) (and .cse33 .cse34 (or (and (or .cse17 (and (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse36))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse9))) .cse10))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse37 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20)))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse37 .cse9))) .cse10)))) .cse12))) .cse38) .cse23) (or .cse27 (and .cse38 (or .cse17 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse39))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse39)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse9))) .cse10)))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse40 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse40))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse9))) .cse10)))) .cse12))))))))) (or .cse44 (and (or (and (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse46))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse47))))) .cse46)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse9))) .cse10)))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse48))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse47))))) .cse48))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse9))) .cse10))))) .cse12)) .cse4) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse9))) .cse10)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse49))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse50)))))))) .cse12) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse51))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse50)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse9))) .cse10))))))) .cse1) (or .cse52 .cse3) (or .cse5 .cse53))) (or (let ((.cse54 (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse56)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse56 .cse9))) .cse10))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse57))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse57))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse9))) .cse10)))) .cse12)))) (and (or .cse4 .cse54) (or .cse55 .cse5) (or .cse55 .cse3) (or .cse1 .cse54))) .cse13) (or (and (or (and (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse58))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse47))))) .cse58)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse58 .cse9))) .cse10))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse59 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse59))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse47))))) .cse59))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse9))) .cse10)))) .cse12)) .cse4) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse60 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse60))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse60 .cse50)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse60 .cse9))) .cse10))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse61 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse9))) .cse10) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse61))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse50)))))))) .cse12)) .cse1) (or .cse5 .cse62) (or .cse63 .cse3)) .cse44) (or (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 .cse43))))))))) (let ((.cse64 (or .cse30 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse70 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse70))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse70))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse70 .cse9))) .cse10)))) .cse12) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse71))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse71)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse71 .cse9))) .cse10)))) .cse6))))) (and (or (and .cse64 (or .cse17 (and (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse9))) .cse10))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse67))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20)))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse9))) .cse10)))) .cse12)))) .cse23) .cse33 .cse34 (or .cse27 (and .cse64 (or .cse17 (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse68))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse68)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse9))) .cse10))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse9))) .cse10) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse69))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse69)))))))) .cse12)))))))) .cse73) (or (let ((.cse75 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse72))))))))) (let ((.cse77 (or .cse30 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse80))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse80))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse80 .cse9))) .cse10))))) .cse12) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse81 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_15|))) .cse81))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse81)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse81 .cse9))) .cse10)))))))))) (and .cse15 (or (and (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse74 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse74))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse74)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse74 .cse9))) .cse10)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse76 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse76 .cse9))) .cse10)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse76))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse76)))))))) .cse12)) .cse17) .cse77) .cse27) .cse16 (or (and .cse77 (or .cse17 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse78 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse78))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse78 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20))))))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse78 .cse9))) .cse10))))) .cse6) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse79 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse79))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_15|))) .cse20)))))))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 .cse9))) .cse10))))) .cse12)))) .cse23)))) .cse73)))))))) is different from false