./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:13,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:13,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:45:13,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:13,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:13,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:13,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:13,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:13,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:13,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:13,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:13,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:13,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:13,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:13,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:13,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:13,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:13,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:13,618 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/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 -> 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 [2025-03-16 22:45:13,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:13,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:13,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:13,849 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:13,851 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:13,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-03-16 22:45:15,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c6d7357/f9317938e80846909930803b905e59ad/FLAG40cc63808 [2025-03-16 22:45:15,307 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:15,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-03-16 22:45:15,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c6d7357/f9317938e80846909930803b905e59ad/FLAG40cc63808 [2025-03-16 22:45:15,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c6d7357/f9317938e80846909930803b905e59ad [2025-03-16 22:45:15,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:15,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:15,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:15,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:15,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:15,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:15,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4dffcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15, skipping insertion in model container [2025-03-16 22:45:15,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:15,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:15,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-03-16 22:45:15,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:15,842 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:15,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-03-16 22:45:15,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:15,919 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:15,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15 WrapperNode [2025-03-16 22:45:15,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:15,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:15,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:15,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:15,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:15,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:15,999 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 729 [2025-03-16 22:45:15,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:16,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:16,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:16,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:16,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,055 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-03-16 22:45:16,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:16,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:16,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:16,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:16,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (1/1) ... [2025-03-16 22:45:16,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:16,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:45:16,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:45:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:45:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:16,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:16,289 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:16,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:17,024 INFO L? ?]: Removed 377 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:17,025 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:17,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:17,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:17,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:17 BoogieIcfgContainer [2025-03-16 22:45:17,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:17,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:17,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:17,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:17,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:15" (1/3) ... [2025-03-16 22:45:17,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aea102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:17, skipping insertion in model container [2025-03-16 22:45:17,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:15" (2/3) ... [2025-03-16 22:45:17,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aea102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:17, skipping insertion in model container [2025-03-16 22:45:17,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:17" (3/3) ... [2025-03-16 22:45:17,074 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-03-16 22:45:17,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:17,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c that has 1 procedures, 140 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:17,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:17,182 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;@43baa891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:17,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.5) internal successors, (207), 139 states have internal predecessors, (207), 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-03-16 22:45:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 22:45:17,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:17,193 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] [2025-03-16 22:45:17,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:17,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1168482644, now seen corresponding path program 1 times [2025-03-16 22:45:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978131564] [2025-03-16 22:45:17,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:17,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 22:45:17,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 22:45:17,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978131564] [2025-03-16 22:45:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978131564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447811136] [2025-03-16 22:45:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:17,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:17,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:17,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:17,764 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.5) internal successors, (207), 139 states have internal predecessors, (207), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-03-16 22:45:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:17,901 INFO L93 Difference]: Finished difference Result 227 states and 337 transitions. [2025-03-16 22:45:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-03-16 22:45:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:17,909 INFO L225 Difference]: With dead ends: 227 [2025-03-16 22:45:17,910 INFO L226 Difference]: Without dead ends: 140 [2025-03-16 22:45:17,913 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-03-16 22:45:17,915 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:17,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-16 22:45:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-16 22:45:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 139 states have internal predecessors, (206), 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-03-16 22:45:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-16 22:45:17,947 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 40 [2025-03-16 22:45:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-16 22:45:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-03-16 22:45:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-16 22:45:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 22:45:17,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:17,949 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] [2025-03-16 22:45:17,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:45:17,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:17,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1858544348, now seen corresponding path program 1 times [2025-03-16 22:45:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:17,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986788299] [2025-03-16 22:45:17,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:17,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 22:45:17,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 22:45:17,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:17,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986788299] [2025-03-16 22:45:18,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986788299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:18,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222317240] [2025-03-16 22:45:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:18,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:18,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:18,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:18,125 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-16 22:45:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:18,225 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2025-03-16 22:45:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-03-16 22:45:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:18,227 INFO L225 Difference]: With dead ends: 229 [2025-03-16 22:45:18,228 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 22:45:18,228 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-03-16 22:45:18,229 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:18,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 22:45:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-16 22:45:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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-03-16 22:45:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2025-03-16 22:45:18,239 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 41 [2025-03-16 22:45:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:18,239 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2025-03-16 22:45:18,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-16 22:45:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2025-03-16 22:45:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 22:45:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:18,240 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] [2025-03-16 22:45:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:45:18,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash 151209383, now seen corresponding path program 1 times [2025-03-16 22:45:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:18,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363611981] [2025-03-16 22:45:18,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:18,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 22:45:18,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 22:45:18,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:18,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363611981] [2025-03-16 22:45:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363611981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:18,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736079251] [2025-03-16 22:45:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:18,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:18,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:18,643 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-03-16 22:45:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:18,824 INFO L93 Difference]: Finished difference Result 235 states and 343 transitions. [2025-03-16 22:45:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:18,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2025-03-16 22:45:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:18,826 INFO L225 Difference]: With dead ends: 235 [2025-03-16 22:45:18,826 INFO L226 Difference]: Without dead ends: 146 [2025-03-16 22:45:18,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:18,827 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 178 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:18,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 604 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:45:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-16 22:45:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-03-16 22:45:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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-03-16 22:45:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-03-16 22:45:18,832 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 42 [2025-03-16 22:45:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:18,833 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-03-16 22:45:18,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-03-16 22:45:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-03-16 22:45:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:45:18,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:18,834 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] [2025-03-16 22:45:18,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:45:18,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2014081111, now seen corresponding path program 1 times [2025-03-16 22:45:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435022346] [2025-03-16 22:45:18,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:18,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:18,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:18,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:18,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:19,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435022346] [2025-03-16 22:45:19,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435022346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:19,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:19,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:45:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233286400] [2025-03-16 22:45:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:45:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:19,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:45:19,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:19,170 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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-03-16 22:45:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:19,349 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2025-03-16 22:45:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:45:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-03-16 22:45:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:19,351 INFO L225 Difference]: With dead ends: 241 [2025-03-16 22:45:19,351 INFO L226 Difference]: Without dead ends: 149 [2025-03-16 22:45:19,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:19,352 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 171 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:19,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 758 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:45:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-16 22:45:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2025-03-16 22:45:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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-03-16 22:45:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-03-16 22:45:19,357 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 43 [2025-03-16 22:45:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:19,357 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-03-16 22:45:19,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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-03-16 22:45:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-03-16 22:45:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:45:19,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:19,358 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] [2025-03-16 22:45:19,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:45:19,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:19,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash 627182593, now seen corresponding path program 1 times [2025-03-16 22:45:19,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792542734] [2025-03-16 22:45:19,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:19,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:19,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:19,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:19,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:19,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:45:19,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:19,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:19,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:19,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:19,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:45:19,462 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:45:19,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:45:19,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:45:19,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 22:45:19,495 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:45:19,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:45:19,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:45:19 BoogieIcfgContainer [2025-03-16 22:45:19,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:45:19,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:45:19,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:45:19,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:45:19,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:17" (3/4) ... [2025-03-16 22:45:19,519 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:45:19,520 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:45:19,521 INFO L158 Benchmark]: Toolchain (without parser) took 3915.31ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.0MB in the beginning and 175.6MB in the end (delta: -65.6MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2025-03-16 22:45:19,521 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 127.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:19,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.85ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 88.2MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:45:19,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.94ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 74.7MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:45:19,522 INFO L158 Benchmark]: Boogie Preprocessor took 118.26ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 67.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:45:19,522 INFO L158 Benchmark]: IcfgBuilder took 945.51ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 48.6MB in the end (delta: 18.7MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-03-16 22:45:19,522 INFO L158 Benchmark]: TraceAbstraction took 2446.35ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 48.0MB in the beginning and 175.6MB in the end (delta: -127.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:45:19,522 INFO L158 Benchmark]: Witness Printer took 6.83ms. Allocated memory is still 285.2MB. Free memory was 175.6MB in the beginning and 175.6MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:19,523 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.76ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 127.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.85ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 88.2MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.94ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 74.7MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.26ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 67.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 945.51ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 48.6MB in the end (delta: 18.7MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2446.35ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 48.0MB in the beginning and 175.6MB in the end (delta: -127.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 6.83ms. Allocated memory is still 285.2MB. Free memory was 175.6MB in the beginning and 175.6MB in the end (delta: 37.1kB). 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 168. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L44] const SORT_67 var_68 = 0; [L45] const SORT_10 var_119 = 104; [L46] const SORT_10 var_136 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_29; [L53] SORT_31 input_32; [L54] SORT_31 input_34; [L55] SORT_1 input_36; [L56] SORT_1 input_38; [L57] SORT_1 input_44; [L58] SORT_1 input_46; [L59] SORT_1 input_48; [L60] SORT_3 input_52; [L61] SORT_1 input_55; [L62] SORT_1 input_63; [L63] SORT_1 input_73; [L64] SORT_1 input_79; [L65] SORT_1 input_81; [L66] SORT_1 input_95; [L67] SORT_1 input_101; [L68] SORT_1 input_107; [L69] SORT_1 input_113; [L70] SORT_1 input_114; [L71] SORT_1 input_115; [L72] SORT_67 input_134; [L73] SORT_1 input_143; [L74] SORT_1 input_144; [L75] SORT_1 input_145; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L78] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L79] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L81] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L82] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L83] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L84] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L85] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L86] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L87] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L88] SORT_67 state_69 = __VERIFIER_nondet_ushort() & mask_SORT_67; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L89] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] SORT_1 init_9_arg_1 = var_7; [L92] state_8 = init_9_arg_1 [L93] SORT_1 init_15_arg_1 = var_7; [L94] state_14 = init_15_arg_1 [L95] SORT_1 init_26_arg_1 = var_7; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_28_arg_1 = var_7; [L98] state_27 = init_28_arg_1 [L99] SORT_1 init_41_arg_1 = var_7; [L100] state_40 = init_41_arg_1 [L101] SORT_1 init_43_arg_1 = var_7; [L102] state_42 = init_43_arg_1 [L103] SORT_1 init_51_arg_1 = var_21; [L104] state_50 = init_51_arg_1 [L105] SORT_1 init_58_arg_1 = var_7; [L106] state_57 = init_58_arg_1 [L107] SORT_1 init_60_arg_1 = var_7; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_62_arg_1 = var_7; [L110] state_61 = init_62_arg_1 [L111] SORT_1 init_66_arg_1 = var_7; [L112] state_65 = init_66_arg_1 [L113] SORT_67 init_70_arg_1 = var_68; [L114] state_69 = init_70_arg_1 [L115] SORT_1 init_72_arg_1 = var_7; [L116] state_71 = init_72_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L119] input_2 = __VERIFIER_nondet_uchar() [L120] input_4 = __VERIFIER_nondet_uchar() [L121] input_5 = __VERIFIER_nondet_uchar() [L122] input_6 = __VERIFIER_nondet_uchar() [L123] input_29 = __VERIFIER_nondet_uchar() [L124] input_32 = __VERIFIER_nondet_uchar() [L125] input_34 = __VERIFIER_nondet_uchar() [L126] input_36 = __VERIFIER_nondet_uchar() [L127] input_38 = __VERIFIER_nondet_uchar() [L128] input_44 = __VERIFIER_nondet_uchar() [L129] input_46 = __VERIFIER_nondet_uchar() [L130] input_48 = __VERIFIER_nondet_uchar() [L131] input_52 = __VERIFIER_nondet_uchar() [L132] input_55 = __VERIFIER_nondet_uchar() [L133] input_63 = __VERIFIER_nondet_uchar() [L134] input_73 = __VERIFIER_nondet_uchar() [L135] input_79 = __VERIFIER_nondet_uchar() [L136] input_81 = __VERIFIER_nondet_uchar() [L137] input_95 = __VERIFIER_nondet_uchar() [L138] input_101 = __VERIFIER_nondet_uchar() [L139] input_107 = __VERIFIER_nondet_uchar() [L140] input_113 = __VERIFIER_nondet_uchar() [L141] input_114 = __VERIFIER_nondet_uchar() [L142] input_115 = __VERIFIER_nondet_uchar() [L143] input_134 = __VERIFIER_nondet_ushort() [L144] input_143 = __VERIFIER_nondet_uchar() [L145] input_144 = __VERIFIER_nondet_uchar() [L146] input_145 = __VERIFIER_nondet_uchar() [L149] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_11_arg_0=0, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L150] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L150] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L151] SORT_10 var_11 = var_11_arg_0; [L152] SORT_10 var_13_arg_0 = var_11; [L153] SORT_10 var_13_arg_1 = var_12; [L154] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L155] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_13=1, var_16_arg_0=0, var_21=1, var_68=0, var_7=0] [L156] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_13=1, var_21=1, var_68=0, var_7=0] [L156] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L157] SORT_10 var_16 = var_16_arg_0; [L158] SORT_10 var_17_arg_0 = var_16; [L159] SORT_10 var_17_arg_1 = var_12; [L160] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L161] SORT_1 var_18_arg_0 = var_13; [L162] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_68=0, var_7=0] [L163] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L163] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L164] SORT_1 var_22_arg_0 = var_18; [L165] SORT_1 var_22 = ~var_22_arg_0; [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_68=0, var_7=0] [L168] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L168] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L169] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L169] var_23 = var_23 & mask_SORT_1 [L170] SORT_1 bad_24_arg_0 = var_23; [L171] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 207 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 2363 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1717 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 698 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 646 mSDtfsCounter, 698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-03-16 22:45:19,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:21,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:21,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:45:21,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:21,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:21,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:21,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:21,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:21,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:21,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:21,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:21,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:21,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:21,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:21,522 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:21,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:21,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:21,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:21,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:21,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:21,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:21,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:21,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:21,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:21,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:21,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:21,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:21,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:21,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:21,525 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/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 -> 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 [2025-03-16 22:45:21,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:21,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:21,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:21,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:21,788 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:21,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-03-16 22:45:23,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ced2d2ee/4f4e417cb2c84357b30cc35400cca6a6/FLAG17d134428 [2025-03-16 22:45:23,297 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:23,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-03-16 22:45:23,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ced2d2ee/4f4e417cb2c84357b30cc35400cca6a6/FLAG17d134428 [2025-03-16 22:45:23,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ced2d2ee/4f4e417cb2c84357b30cc35400cca6a6 [2025-03-16 22:45:23,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:23,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:23,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:23,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:23,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:23,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:23,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c6d113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23, skipping insertion in model container [2025-03-16 22:45:23,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:23,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:23,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-03-16 22:45:23,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:23,881 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:23,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-03-16 22:45:23,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:23,985 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:23,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23 WrapperNode [2025-03-16 22:45:23,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:23,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:23,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:23,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:23,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,039 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 465 [2025-03-16 22:45:24,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:24,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:24,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:24,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:24,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,072 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-03-16 22:45:24,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:24,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:24,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:24,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:24,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (1/1) ... [2025-03-16 22:45:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:24,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:45:24,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:45:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:45:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:24,260 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:24,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:24,596 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:24,597 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:24,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:24,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:24,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:24 BoogieIcfgContainer [2025-03-16 22:45:24,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:24,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:24,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:24,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:23" (1/3) ... [2025-03-16 22:45:24,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7946c51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:24, skipping insertion in model container [2025-03-16 22:45:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:23" (2/3) ... [2025-03-16 22:45:24,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7946c51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:24, skipping insertion in model container [2025-03-16 22:45:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:24" (3/3) ... [2025-03-16 22:45:24,616 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-03-16 22:45:24,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:24,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:24,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:24,675 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;@19967395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:24,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:24,679 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-03-16 22:45:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:45:24,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:24,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:45:24,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:45:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259481399] [2025-03-16 22:45:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:24,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:24,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:24,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:45:24,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:45:24,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:45:24,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:45:24,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:24,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:45:24,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:25,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:45:25,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:45:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259481399] [2025-03-16 22:45:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259481399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:25,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:25,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:45:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198602139] [2025-03-16 22:45:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:25,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:45:25,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:25,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:25,032 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-03-16 22:45:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:25,066 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:45:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:25,068 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-03-16 22:45:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:25,072 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:45:25,072 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:45:25,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 22:45:25,076 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-03-16 22:45:25,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:45:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:45:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:45:25,091 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-03-16 22:45:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:45:25,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:45:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:25,094 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:45:25,094 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-03-16 22:45:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:45:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:45:25,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:25,095 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:45:25,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:45:25,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:25,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:25,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:45:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180971007] [2025-03-16 22:45:25,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:25,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:45:25,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:45:25,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:45:25,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:45:25,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:25,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:25,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 22:45:25,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:25,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:45:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:26,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:45:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180971007] [2025-03-16 22:45:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180971007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:45:26,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:45:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:45:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605129378] [2025-03-16 22:45:26,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:45:26,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:45:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:45:26,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:45:26,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:26,370 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-03-16 22:45:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:26,455 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 22:45:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:26,455 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-03-16 22:45:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:26,456 INFO L225 Difference]: With dead ends: 14 [2025-03-16 22:45:26,456 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 22:45:26,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:45:26,457 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:26,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:45:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 22:45:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 22:45:26,461 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-03-16 22:45:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:45:26,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:45:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:26,462 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:45:26,462 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-03-16 22:45:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:45:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:45:26,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:26,463 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:45:26,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:45:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:26,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:26,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:45:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484757973] [2025-03-16 22:45:26,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:45:26,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:26,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:26,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:45:26,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:45:26,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 22:45:26,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 22:45:26,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:45:26,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:26,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 22:45:26,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:27,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:45:31,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~state_71~0#1| (_ bv0 8))) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_8| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_65~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse6)))))) (.cse2 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_8| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_65~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse6))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))) (.cse8 (not .cse9)) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_15|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_0~0#1_15|))))))))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_15|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_0~0#1_15|))))))))))))))) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_14~0#1|))))))) (and (or (let ((.cse0 (and (or (let ((.cse4 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse7))))))))) (and (or .cse3 .cse4) (or .cse5 (not .cse4)))) .cse8) (or .cse9 (let ((.cse10 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse11))))))))) (and (or .cse5 (not .cse10)) (or .cse10 .cse3))))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) (not .cse12)) (or .cse12 (and (or .cse1 (let ((.cse13 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_21~0#1|)))))))))))))))) (and (or .cse13 .cse3) (or .cse5 (not .cse13))))) (or .cse2 (and (or (let ((.cse14 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse11))))))))))))) (and (or .cse3 .cse14) (or (not .cse14) .cse5))) .cse9) (or .cse8 (let ((.cse15 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse7)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or .cse5 (not .cse15)) (or .cse3 .cse15))))))))))) is different from false [2025-03-16 22:46:12,363 WARN L286 SmtUtils]: Spent 18.52s on a formula simplification that was a NOOP. DAG size: 542 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:46:48,624 WARN L286 SmtUtils]: Spent 14.46s on a formula simplification that was a NOOP. DAG size: 545 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)