./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_p03.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 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:26:18,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:26:18,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:26:18,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:26:18,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:26:18,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:26:18,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:26:18,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:26:18,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:26:18,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:26:18,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:26:18,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:26:18,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:26:18,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:26:18,119 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:26:18,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:26:18,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:26:18,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:26:18,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:26:18,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:26:18,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:26:18,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:26:18,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:26:18,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:26:18,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:26:18,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:26:18,122 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 -> 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 [2025-03-03 18:26:18,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:26:18,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:26:18,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:26:18,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:26:18,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:26:18,376 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_p03.c [2025-03-03 18:26:19,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981870a11/6504a538536f4f8d8358cbe720db2734/FLAG1cd12cece [2025-03-03 18:26:19,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:26:19,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-03 18:26:19,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981870a11/6504a538536f4f8d8358cbe720db2734/FLAG1cd12cece [2025-03-03 18:26:19,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981870a11/6504a538536f4f8d8358cbe720db2734 [2025-03-03 18:26:19,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:26:19,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:26:19,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:26:19,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:26:19,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:26:19,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:26:19" (1/1) ... [2025-03-03 18:26:19,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66109056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:19, skipping insertion in model container [2025-03-03 18:26:19,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:26:19" (1/1) ... [2025-03-03 18:26:19,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:26:19,938 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_p03.c[1266,1279] [2025-03-03 18:26:20,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:26:20,047 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:26:20,056 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_p03.c[1266,1279] [2025-03-03 18:26:20,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:26:20,133 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:26:20,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20 WrapperNode [2025-03-03 18:26:20,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:26:20,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:26:20,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:26:20,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:26:20,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,226 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 682 [2025-03-03 18:26:20,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:26:20,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:26:20,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:26:20,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:26:20,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,268 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-03 18:26:20,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:26:20,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:26:20,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:26:20,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:26:20,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (1/1) ... [2025-03-03 18:26:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:26:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:20,341 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-03 18:26:20,345 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-03 18:26:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:26:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:26:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:26:20,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:26:20,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:26:20,462 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:26:21,158 INFO L? ?]: Removed 349 outVars from TransFormulas that were not future-live. [2025-03-03 18:26:21,158 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:26:21,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:26:21,194 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:26:21,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:21 BoogieIcfgContainer [2025-03-03 18:26:21,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:26:21,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:26:21,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:26:21,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:26:21,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:26:19" (1/3) ... [2025-03-03 18:26:21,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e137e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:26:21, skipping insertion in model container [2025-03-03 18:26:21,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:20" (2/3) ... [2025-03-03 18:26:21,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e137e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:26:21, skipping insertion in model container [2025-03-03 18:26:21,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:21" (3/3) ... [2025-03-03 18:26:21,200 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-03 18:26:21,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:26:21,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:26:21,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:26:21,262 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;@421c9a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:26:21,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:26:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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-03 18:26:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 18:26:21,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:21,270 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] [2025-03-03 18:26:21,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:21,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 867189838, now seen corresponding path program 1 times [2025-03-03 18:26:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913418116] [2025-03-03 18:26:21,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:21,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 18:26:21,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 18:26:21,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:21,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:21,771 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-03 18:26:21,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:21,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913418116] [2025-03-03 18:26:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913418116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:21,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195564050] [2025-03-03 18:26:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:21,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:21,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:21,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:21,790 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03 18:26:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:21,894 INFO L93 Difference]: Finished difference Result 209 states and 309 transitions. [2025-03-03 18:26:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:21,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2025-03-03 18:26:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:21,901 INFO L225 Difference]: With dead ends: 209 [2025-03-03 18:26:21,902 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 18:26:21,904 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-03 18:26:21,906 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:21,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:26:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 18:26:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-03 18:26:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:26:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2025-03-03 18:26:21,939 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 35 [2025-03-03 18:26:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2025-03-03 18:26:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03 18:26:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2025-03-03 18:26:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 18:26:21,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:21,941 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] [2025-03-03 18:26:21,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:26:21,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1117760452, now seen corresponding path program 1 times [2025-03-03 18:26:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795298672] [2025-03-03 18:26:21,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:21,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 18:26:21,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 18:26:21,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:21,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:22,078 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-03 18:26:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795298672] [2025-03-03 18:26:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795298672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551825361] [2025-03-03 18:26:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:22,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:22,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:22,080 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-03 18:26:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:22,152 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2025-03-03 18:26:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2025-03-03 18:26:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:22,154 INFO L225 Difference]: With dead ends: 210 [2025-03-03 18:26:22,154 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 18:26:22,154 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-03 18:26:22,154 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:22,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:26:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 18:26:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-03 18:26:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 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-03 18:26:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2025-03-03 18:26:22,160 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 36 [2025-03-03 18:26:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:22,160 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2025-03-03 18:26:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-03 18:26:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2025-03-03 18:26:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 18:26:22,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:22,161 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] [2025-03-03 18:26:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:26:22,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2072622327, now seen corresponding path program 1 times [2025-03-03 18:26:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835677823] [2025-03-03 18:26:22,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:22,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 18:26:22,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 18:26:22,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:22,339 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-03 18:26:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835677823] [2025-03-03 18:26:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835677823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:22,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:22,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915240438] [2025-03-03 18:26:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:22,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:22,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:22,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:22,340 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03 18:26:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:22,443 INFO L93 Difference]: Finished difference Result 210 states and 306 transitions. [2025-03-03 18:26:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2025-03-03 18:26:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:22,444 INFO L225 Difference]: With dead ends: 210 [2025-03-03 18:26:22,444 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 18:26:22,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:22,445 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 158 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:22,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 281 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:26:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 18:26:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-03 18:26:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4609375) internal successors, (187), 128 states have internal predecessors, (187), 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-03 18:26:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 187 transitions. [2025-03-03 18:26:22,453 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 187 transitions. Word has length 37 [2025-03-03 18:26:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:22,454 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 187 transitions. [2025-03-03 18:26:22,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03 18:26:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 187 transitions. [2025-03-03 18:26:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 18:26:22,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:22,454 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] [2025-03-03 18:26:22,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:26:22,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -907280687, now seen corresponding path program 1 times [2025-03-03 18:26:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17976642] [2025-03-03 18:26:22,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:22,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 18:26:22,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 18:26:22,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:22,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:26:22,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:26:22,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 18:26:22,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 18:26:22,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:22,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:26:22,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:26:22,580 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:26:22,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:26:22,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:26:22,584 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 18:26:22,607 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:26:22,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:26:22,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:26:22 BoogieIcfgContainer [2025-03-03 18:26:22,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:26:22,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:26:22,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:26:22,620 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:26:22,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:21" (3/4) ... [2025-03-03 18:26:22,622 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:26:22,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:26:22,623 INFO L158 Benchmark]: Toolchain (without parser) took 2819.25ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 65.9MB in the end (delta: 63.5MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2025-03-03 18:26:22,624 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 192.9MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:26:22,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.68ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 108.8MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:26:22,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.42ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 96.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:26:22,625 INFO L158 Benchmark]: Boogie Preprocessor took 87.86ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 88.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:26:22,625 INFO L158 Benchmark]: IcfgBuilder took 877.69ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 93.0MB in the end (delta: -4.4MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2025-03-03 18:26:22,625 INFO L158 Benchmark]: TraceAbstraction took 1424.07ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 65.9MB in the end (delta: 26.3MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-03-03 18:26:22,626 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 65.9MB in the beginning and 65.9MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:26:22,627 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.39ms. Allocated memory is still 192.9MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.68ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 108.8MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.42ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 96.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.86ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 88.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 877.69ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 93.0MB in the end (delta: -4.4MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1424.07ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 65.9MB in the end (delta: 26.3MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 65.9MB in the beginning and 65.9MB in the end (delta: 19.6kB). 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 161. 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_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 10); [L33] const SORT_7 msb_SORT_7 = (SORT_7)1 << (10 - 1); [L35] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 2); [L36] const SORT_11 msb_SORT_11 = (SORT_11)1 << (2 - 1); [L38] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L39] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L41] const SORT_30 mask_SORT_30 = (SORT_30)-1 >> (sizeof(SORT_30) * 8 - 4); [L42] const SORT_30 msb_SORT_30 = (SORT_30)1 << (4 - 1); [L44] const SORT_7 var_8 = 0; [L45] const SORT_13 var_15 = 0; [L46] const SORT_1 var_19 = 1; [L47] const SORT_1 var_23 = 0; [L48] const SORT_13 var_74 = 1; [L49] const SORT_13 var_78 = 104; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_1 input_6; [L55] SORT_1 input_28; [L56] SORT_30 input_31; [L57] SORT_1 input_33; [L58] SORT_30 input_35; [L59] SORT_1 input_37; [L60] SORT_1 input_39; [L61] SORT_1 input_45; [L62] SORT_1 input_47; [L63] SORT_1 input_49; [L64] SORT_3 input_53; [L65] SORT_1 input_56; [L66] SORT_1 input_66; [L67] SORT_7 input_72; [L68] SORT_1 input_86; [L69] SORT_1 input_92; [L70] SORT_1 input_98; [L71] SORT_1 input_104; [L72] SORT_1 input_105; [L73] SORT_1 input_106; [L74] SORT_1 input_120; [L75] SORT_1 input_122; [L76] SORT_1 input_137; [L77] SORT_1 input_138; [L78] SORT_1 input_139; [L80] EXPR __VERIFIER_nondet_ushort() & mask_SORT_7 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L80] SORT_7 state_9 = __VERIFIER_nondet_ushort() & mask_SORT_7; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L81] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L82] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L83] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L84] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L85] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L86] SORT_1 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L87] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L88] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L89] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L90] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L91] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] SORT_7 init_10_arg_1 = var_8; [L94] state_9 = init_10_arg_1 [L95] SORT_1 init_25_arg_1 = var_23; [L96] state_24 = init_25_arg_1 [L97] SORT_1 init_27_arg_1 = var_23; [L98] state_26 = init_27_arg_1 [L99] SORT_1 init_42_arg_1 = var_23; [L100] state_41 = init_42_arg_1 [L101] SORT_1 init_44_arg_1 = var_23; [L102] state_43 = init_44_arg_1 [L103] SORT_1 init_52_arg_1 = var_19; [L104] state_51 = init_52_arg_1 [L105] SORT_1 init_59_arg_1 = var_23; [L106] state_58 = init_59_arg_1 [L107] SORT_1 init_61_arg_1 = var_23; [L108] state_60 = init_61_arg_1 [L109] SORT_1 init_63_arg_1 = var_23; [L110] state_62 = init_63_arg_1 [L111] SORT_1 init_65_arg_1 = var_23; [L112] state_64 = init_65_arg_1 [L113] SORT_1 init_69_arg_1 = var_23; [L114] state_68 = init_69_arg_1 [L115] SORT_1 init_71_arg_1 = var_23; [L116] state_70 = init_71_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=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_28 = __VERIFIER_nondet_uchar() [L124] input_31 = __VERIFIER_nondet_uchar() [L125] input_33 = __VERIFIER_nondet_uchar() [L126] input_35 = __VERIFIER_nondet_uchar() [L127] input_37 = __VERIFIER_nondet_uchar() [L128] input_39 = __VERIFIER_nondet_uchar() [L129] input_45 = __VERIFIER_nondet_uchar() [L130] input_47 = __VERIFIER_nondet_uchar() [L131] input_49 = __VERIFIER_nondet_uchar() [L132] input_53 = __VERIFIER_nondet_uchar() [L133] input_56 = __VERIFIER_nondet_uchar() [L134] input_66 = __VERIFIER_nondet_uchar() [L135] input_72 = __VERIFIER_nondet_ushort() [L136] input_86 = __VERIFIER_nondet_uchar() [L137] input_92 = __VERIFIER_nondet_uchar() [L138] input_98 = __VERIFIER_nondet_uchar() [L139] input_104 = __VERIFIER_nondet_uchar() [L140] input_105 = __VERIFIER_nondet_uchar() [L141] input_106 = __VERIFIER_nondet_uchar() [L142] input_120 = __VERIFIER_nondet_uchar() [L143] input_122 = __VERIFIER_nondet_uchar() [L144] input_137 = __VERIFIER_nondet_uchar() [L145] input_138 = __VERIFIER_nondet_uchar() [L146] input_139 = __VERIFIER_nondet_uchar() [L149] SORT_7 var_12_arg_0 = state_9; [L150] SORT_11 var_12 = var_12_arg_0 >> 8; [L151] SORT_11 var_14_arg_0 = var_12; VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_14_arg_0=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L152] EXPR var_14_arg_0 & mask_SORT_11 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L152] var_14_arg_0 = var_14_arg_0 & mask_SORT_11 [L153] SORT_13 var_14 = var_14_arg_0; [L154] SORT_13 var_16_arg_0 = var_14; [L155] SORT_13 var_16_arg_1 = var_15; [L156] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L157] SORT_1 var_20_arg_0 = var_16; [L158] SORT_1 var_20 = ~var_20_arg_0; [L159] SORT_1 var_21_arg_0 = var_19; [L160] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_21_arg_0=1, var_21_arg_1=-2, var_23=0, var_74=1, var_78=104, var_8=0] [L161] EXPR var_21_arg_0 & var_21_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L161] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L162] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L162] var_21 = var_21 & mask_SORT_1 [L163] SORT_1 bad_22_arg_0 = var_21; [L164] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 1198 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 747 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 451 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:26:22,642 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_p03.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 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:26:24,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:26:24,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:26:24,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:26:24,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:26:24,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:26:24,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:26:24,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:26:24,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:26:24,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:26:24,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:26:24,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:26:24,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:26:24,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:26:24,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:26:24,582 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:26:24,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:26:24,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:26:24,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:26:24,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:26:24,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:26:24,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:26:24,584 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:26:24,584 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:26:24,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:26:24,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:26:24,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:26:24,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:26:24,585 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 -> 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 [2025-03-03 18:26:24,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:26:24,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:26:24,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:26:24,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:26:24,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:26:24,844 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_p03.c [2025-03-03 18:26:26,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa7a43ca/6197a936c6484acf9b37dd063a01a03f/FLAG049323d03 [2025-03-03 18:26:26,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:26:26,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-03 18:26:26,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa7a43ca/6197a936c6484acf9b37dd063a01a03f/FLAG049323d03 [2025-03-03 18:26:26,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa7a43ca/6197a936c6484acf9b37dd063a01a03f [2025-03-03 18:26:26,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:26:26,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:26:26,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:26:26,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:26:26,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:26:26,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da07423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26, skipping insertion in model container [2025-03-03 18:26:26,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:26:26,444 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_p03.c[1266,1279] [2025-03-03 18:26:26,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:26:26,556 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:26:26,565 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_p03.c[1266,1279] [2025-03-03 18:26:26,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:26:26,640 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:26:26,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26 WrapperNode [2025-03-03 18:26:26,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:26:26,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:26:26,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:26:26,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:26:26,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,691 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 442 [2025-03-03 18:26:26,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:26:26,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:26:26,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:26:26,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:26:26,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,726 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-03 18:26:26,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:26:26,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:26:26,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:26:26,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:26:26,756 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (1/1) ... [2025-03-03 18:26:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:26:26,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:26,780 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-03 18:26:26,783 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-03 18:26:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:26:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:26:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:26:26,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:26:26,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:26:26,911 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:26:27,201 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-03 18:26:27,202 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:26:27,208 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:26:27,209 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:26:27,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:27 BoogieIcfgContainer [2025-03-03 18:26:27,210 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:26:27,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:26:27,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:26:27,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:26:27,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:26:26" (1/3) ... [2025-03-03 18:26:27,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8fa094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:26:27, skipping insertion in model container [2025-03-03 18:26:27,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:26" (2/3) ... [2025-03-03 18:26:27,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8fa094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:26:27, skipping insertion in model container [2025-03-03 18:26:27,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:27" (3/3) ... [2025-03-03 18:26:27,218 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-03 18:26:27,228 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:26:27,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:26:27,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:26:27,272 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;@5a9ae8c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:26:27,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:26:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-03 18:26:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:26:27,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:27,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:26:27,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:27,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:26:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:26:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750108649] [2025-03-03 18:26:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:27,291 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-03 18:26:27,292 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-03 18:26:27,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:26:27,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:26:27,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:27,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:27,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 18:26:27,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:27,598 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-03 18:26:27,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:26:27,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:26:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750108649] [2025-03-03 18:26:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750108649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:27,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968035288] [2025-03-03 18:26:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:27,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:27,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:26:27,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:27,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:27,624 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03 18:26:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:27,669 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:26:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:27,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-03 18:26:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:27,678 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:26:27,678 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:26:27,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:27,682 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-03 18:26:27,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:26:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:26:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:26:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-03 18:26:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:26:27,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:26:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:26:27,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03 18:26:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:26:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:26:27,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:27,706 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:27,714 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-03 18:26:27,911 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-03 18:26:27,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:27,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:26:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:26:27,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728796460] [2025-03-03 18:26:27,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:27,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:27,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:27,915 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-03 18:26:27,917 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-03 18:26:28,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:26:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:26:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:28,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 18:26:28,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:28,263 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-03 18:26:28,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:28,843 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-03 18:26:28,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:26:28,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728796460] [2025-03-03 18:26:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728796460] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:26:28,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:26:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 18:26:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076176412] [2025-03-03 18:26:28,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:26:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:26:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:26:28,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:26:28,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:28,845 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-03 18:26:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:28,935 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 18:26:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:28,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-03-03 18:26:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:28,935 INFO L225 Difference]: With dead ends: 15 [2025-03-03 18:26:28,936 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 18:26:28,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:26:28,936 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:28,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:26:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 18:26:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-03 18:26:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-03 18:26:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 18:26:28,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 18:26:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:28,939 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 18:26:28,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-03 18:26:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 18:26:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 18:26:28,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:28,940 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 18:26:28,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:26:29,140 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-03 18:26:29,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:29,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:29,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 18:26:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:26:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098204280] [2025-03-03 18:26:29,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:26:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:26:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:26:29,144 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-03 18:26:29,145 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-03 18:26:29,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 18:26:29,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 18:26:29,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:26:29,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:29,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 18:26:29,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:26:34,531 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-03 18:26:34,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:26:44,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse96 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_23~0#1|))))))) (let ((.cse44 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 .cse96))))) (let ((.cse39 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse96)))) .cse28)) (_ bv0 8))) (.cse7 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_58~0#1|)) (.cse43 (not .cse44)) (.cse6 (= |c_ULTIMATE.start_main_~state_70~0#1| (_ bv0 8))) (.cse85 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ 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) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28)))))) (.cse35 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse95 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse95))) .cse28)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse95))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28))))))) (.cse36 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse94 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse94))) .cse28)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse94))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28))))))) (.cse86 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ 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) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28)))))) (.cse46 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_16|))))))))) (.cse47 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_16|))))))))) (.cse48 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_11~0#1|)) (.cse64 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_8~0#1|))))))))) (let ((.cse16 (let ((.cse93 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse64 (_ bv8 32)))))))))) (and (or .cse93 .cse46) (or (not .cse93) .cse47)))) (.cse15 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse92))) .cse28)) (_ bv0 8))) (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse92)))))) (_ bv0 8)))))) (.cse22 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse91 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse91)))))) (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse91))) .cse28)) (_ bv0 8)))))) (.cse26 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse90 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (= ((_ extract 7 0) (bvand .cse28 .cse90)) (_ bv0 8)) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse90)))))))) (_ bv0 8))))))) (.cse31 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse89 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (= ((_ extract 7 0) (bvand .cse28 .cse89)) (_ bv0 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) ((_ extract 7 0) .cse89))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28)))))))) (.cse30 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse88 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse88))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28)))) (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse88)))) (_ bv0 8)))))) (.cse41 (and (or .cse44 .cse85) (or .cse44 .cse35) (or .cse44 .cse36) (or .cse86 .cse44))) (.cse50 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_9~0#1|)) (.cse23 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse87)))))) (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse87))) .cse28)) (_ bv0 8)))))) (.cse24 (forall ((|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) (_ bv0 8))))) (.cse8 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))) .cse28)) (_ bv0 8))))) (.cse1 (forall ((|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) (_ bv0 8)))) (.cse2 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))) .cse28)) (_ bv0 8)))) (.cse4 (not .cse6)) (.cse42 (and (or .cse36 .cse43) (or .cse35 .cse43) (or .cse85 .cse43) (or .cse86 .cse43))) (.cse19 (not .cse7)) (.cse17 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse84 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse84))) .cse28)) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse84)))))) (_ bv0 8))))))) (.cse40 (not .cse39)) (.cse13 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|))))) (or (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse83))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))) (_ bv0 8)) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse83))))) (_ bv0 8))))))) (.cse9 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (let ((.cse82 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse82))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse82))))) (_ bv0 8))))))) (.cse12 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))) (_ bv0 8))))) (.cse11 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))))))) (.cse0 (= |c_ULTIMATE.start_main_~state_62~0#1| (_ bv0 8)))) (and (or (not .cse0) (let ((.cse49 ((_ zero_extend 16) ((_ extract 15 0) .cse50)))) (let ((.cse18 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse49)))))))))))) (_ bv8 32)))))))))) .cse47) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse49)))))))))))) (_ bv8 32))))))))) .cse46))) (.cse14 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))) (.cse3 (let ((.cse45 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse49)) (_ bv8 32)))))))))) (and (or .cse45 .cse46) (or (not .cse45) .cse47))))) (let ((.cse20 (and (or .cse3 .cse12) (or .cse13 .cse3) (or .cse3 .cse11) (or .cse3 .cse9))) (.cse5 (and (or .cse3 .cse14 .cse43) (or .cse3 .cse43) (or .cse18 .cse44) (or .cse14 .cse44 .cse16))) (.cse25 (and (or (let ((.cse34 (and (or .cse39 .cse14 .cse16) (or .cse3 .cse40) (or .cse3 .cse14 .cse40) (or .cse39 .cse18))) (.cse32 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse38))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28)))) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse38)))) (_ bv0 8))))))) (.cse33 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (not (= ((_ extract 7 0) (bvand .cse28 .cse37)) (_ bv0 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) ((_ extract 7 0) .cse37))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse28))))))))) (and (or .cse14 .cse30 .cse16) (or .cse31 .cse14 .cse16) (or .cse3 .cse32) (or .cse33 .cse3) (or .cse31 .cse18) (or .cse34 .cse35) (or .cse34 .cse36) (or .cse3 .cse14 .cse32) (or .cse33 .cse3 .cse14) (or .cse18 .cse30))) .cse7) (or (and (or .cse14 .cse16 .cse41) (or .cse18 .cse41) (or .cse3 .cse42) (or .cse3 .cse14 .cse42)) .cse19)))) (and (or .cse1 .cse2 (and (or .cse3 .cse4) (or .cse5 .cse6))) (or (and (or .cse7 (let ((.cse10 (and (or .cse14 .cse15 .cse16) (or .cse3 .cse17) (or .cse18 .cse15) (or .cse3 .cse14 .cse17)))) (and (or .cse8 .cse3 .cse9) (or .cse10 .cse11) (or .cse10 .cse12) (or .cse8 .cse13 .cse3)))) (or .cse8 .cse19 .cse20)) .cse4) (or (and (or .cse2 .cse19 .cse20) (or .cse7 (let ((.cse21 (and (or .cse18 .cse22) (or .cse23 .cse3) (or .cse22 .cse14 .cse16) (or .cse23 .cse3 .cse14)))) (and (or .cse13 .cse3 .cse2) (or .cse3 .cse9 .cse2) (or .cse21 .cse12) (or .cse21 .cse11))))) .cse4) (or .cse24 .cse2 .cse5 .cse6) (or .cse24 .cse25 .cse6) (or .cse1 (and (or .cse25 .cse6) (or (and (or .cse8 .cse3) (or .cse7 (let ((.cse27 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (not (= ((_ extract 7 0) (bvand .cse28 .cse29)) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse29)))))))) (_ bv0 8)))))))) (and (or .cse14 .cse16 .cse26) (or .cse18 .cse26) (or .cse27 .cse3) (or .cse27 .cse3 .cse14))))) .cse4)))))))) (or (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_62~0#1|))))))) (let ((.cse74 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse81)))))))) (.cse75 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 .cse81))))) (let ((.cse57 (let ((.cse80 (not .cse75))) (let ((.cse77 (and (or .cse13 .cse80) (or .cse9 .cse80) (or .cse12 .cse80) (or .cse11 .cse80))) (.cse78 (not .cse74)) (.cse79 (and (or .cse42 .cse19) (or (and (or .cse40 .cse35) .cse17 (or .cse40 .cse36)) .cse7)))) (and (or (and (or .cse2 .cse77 .cse19) (or (and (or .cse13 .cse2 .cse78) (or .cse23 .cse11) (or .cse23 .cse12) (or .cse9 .cse2 .cse78)) .cse7)) .cse4) (or .cse24 .cse79 .cse6) (or .cse24 .cse2 .cse43 .cse6) (or (and (or .cse7 (and (or .cse8 .cse13 .cse78) (or .cse8 .cse9 .cse78) (or .cse12 .cse17) (or .cse17 .cse11))) (or .cse8 .cse77 .cse19)) .cse4) (or .cse1 (and (or (and (or (and .cse17 (or .cse8 .cse78)) .cse7) (or .cse8 .cse80)) .cse4) (or .cse79 .cse6))) (or .cse1 .cse2 (and (or .cse43 .cse6) (or .cse80 .cse4))))))) (.cse66 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (let ((.cse76 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse64 .cse76)))) (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse76)))))))) (.cse62 (let ((.cse73 (and (or .cse9 .cse75) (or .cse75 .cse12) (or .cse13 .cse75) (or .cse75 .cse11))) (.cse72 (and (or (and .cse31 .cse30 (or .cse39 .cse36) (or .cse39 .cse35)) .cse7) (or .cse41 .cse19)))) (and (or .cse24 .cse72 .cse6) (or (and (or .cse8 .cse73 .cse19) (or (and (or .cse8 .cse13 .cse74) (or .cse12 .cse15) (or .cse8 .cse9 .cse74) (or .cse11 .cse15)) .cse7)) .cse4) (or .cse24 .cse44 .cse2 .cse6) (or .cse1 (and (or .cse75 .cse4) (or .cse44 .cse6)) .cse2) (or (and (or (and (or .cse13 .cse2 .cse74) (or .cse22 .cse11) (or .cse22 .cse12) (or .cse9 .cse2 .cse74)) .cse7) (or .cse73 .cse2 .cse19)) .cse4) (or .cse1 (and (or .cse72 .cse6) (or (and (or (and (or .cse8 .cse74) .cse26) .cse7) (or .cse8 .cse75)) .cse4))))))) (and (or (and (or .cse46 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse52 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse53 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse52))))) (let ((.cse51 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse53))))))))))) (or (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse51)) (_ bv8 32)))))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse51 .cse52))) .cse53))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse55 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse56 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse55))))) (let ((.cse54 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse56))))))))))) (or (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse54 .cse55))) .cse56) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse54)) (_ bv8 32)))))))))))))) .cse47) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))))))))))) (_ bv8 32))))))))) .cse46) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))))))))))) (_ bv8 32)))))))))) .cse47)) .cse57) (or (and (or .cse46 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse58 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse58)))))))))))) .cse58))))))))))))) (_ bv8 32)))))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse60 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse59 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse60))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse59))))))))) .cse60))) .cse59)))) .cse16) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse61 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse61)))))))))))) .cse61))))))))))))) (_ bv8 32)))))))))) .cse47)) .cse62) (or .cse57 (let ((.cse65 (let ((.cse67 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse64)) (_ bv8 32)))) .cse48)))))) (and (or (not .cse67) .cse47) (or .cse46 .cse67))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (let ((.cse63 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse63))) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse64 .cse63)))))) .cse65) (or .cse65 .cse66)))) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse68 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse69 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse64 .cse68))))) (or (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse68))) .cse69) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse69 |ULTIMATE.start_main_~var_74~0#1|))))))))) (_ bv8 32))))))))))))) .cse47) (or .cse16 .cse66) (or .cse46 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse71 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse70 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse64 .cse71))))) (or (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse70 |ULTIMATE.start_main_~var_74~0#1|))))))))) (_ bv8 32)))))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse50 .cse71))) .cse70))))))) .cse62))))) .cse0)))))) is different from false [2025-03-03 18:27:04,870 WARN L286 SmtUtils]: Spent 13.12s on a formula simplification. DAG size of input: 567 DAG size of output: 539 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 18:27:14,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse72 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse78 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_23~0#1|))))))) (let ((.cse34 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 .cse78))))) (let ((.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_58~0#1|)) (.cse5 (= |c_ULTIMATE.start_main_~state_70~0#1| (_ bv0 8))) (.cse28 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse80 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse80))) .cse72)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse80))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse72))))))) (.cse27 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse79 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse79))) .cse72)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse79))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse72))))))) (.cse25 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ 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) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse72)))))) (.cse24 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ 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) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse72)))))) (.cse33 (not .cse34)) (.cse29 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse78)))) .cse72)) (_ bv0 8))) (.cse39 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_16|))))))))) (.cse38 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_16|))))))))) (.cse36 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_11~0#1|)) (.cse45 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_8~0#1|))))))))) (let ((.cse10 (let ((.cse77 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse45 (_ bv8 32)))))))))) (and (or .cse77 .cse39) (or (not .cse77) .cse38)))) (.cse35 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_9~0#1|)) (.cse23 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (_ bv0 8))))) (.cse30 (not .cse29)) (.cse32 (and (or .cse28 .cse33) (or .cse27 .cse33) (or .cse25 .cse33) (or .cse24 .cse33))) (.cse9 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))))))))) (_ bv0 8))))) (.cse0 (forall ((|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) (_ bv0 8)))) (.cse22 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse76 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse76)))))) (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse76))) .cse72)) (_ bv0 8)))))) (.cse1 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))) .cse72)) (_ bv0 8)))) (.cse13 (forall ((|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) (_ bv0 8))))) (.cse7 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))) .cse72)) (_ bv0 8))))) (.cse3 (not .cse5)) (.cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (let ((.cse75 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse75))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse75))))) (_ bv0 8))))))) (.cse18 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))) (_ bv0 8))))) (.cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (let ((.cse74 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|))))) (or (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse74))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))) (_ bv0 8)) (not (= ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse74))))) (_ bv0 8))))))) (.cse15 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))))))) (.cse31 (and (or .cse34 .cse25) (or .cse34 .cse27) (or .cse34 .cse28) (or .cse24 .cse34))) (.cse19 (not .cse12)) (.cse41 (= |c_ULTIMATE.start_main_~state_62~0#1| (_ bv0 8)))) (and (or (let ((.cse37 ((_ zero_extend 16) ((_ extract 15 0) .cse35)))) (let ((.cse2 (let ((.cse40 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse37)) (_ bv8 32)))))))))) (and (or .cse40 .cse39) (or (not .cse40) .cse38)))) (.cse11 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse37)))))))))))) (_ bv8 32)))))))))) .cse38) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse37)))))))))))) (_ bv8 32))))))))) .cse39))) (.cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|)))))))) (let ((.cse4 (and (or .cse2 .cse8 .cse33) (or .cse2 .cse33) (or .cse11 .cse34) (or .cse8 .cse34 .cse10))) (.cse6 (and (or (let ((.cse26 (and (or .cse29 .cse8 .cse10) (or .cse2 .cse30) (or .cse2 .cse8 .cse30) (or .cse29 .cse11)))) (and (or .cse11 .cse24) (or .cse11 .cse25) (or .cse26 .cse27) (or .cse26 .cse28) (or .cse8 .cse24 .cse10) (or .cse8 .cse10 .cse25))) .cse12) (or (and (or .cse8 .cse10 .cse31) (or .cse11 .cse31) (or .cse2 .cse32) (or .cse2 .cse8 .cse32)) .cse19))) (.cse20 (and (or .cse2 .cse18) (or .cse17 .cse2) (or .cse2 .cse15) (or .cse2 .cse16)))) (and (or .cse0 .cse1 (and (or .cse2 .cse3) (or .cse4 .cse5))) (or .cse0 (and (or .cse6 .cse5) (or (and (or .cse7 .cse2) (or (and (or .cse8 .cse9 .cse10) (or .cse11 .cse9)) .cse12)) .cse3))) (or .cse13 .cse1 .cse4 .cse5) (or (and (or (let ((.cse14 (and (or .cse7 .cse11) (or .cse7 .cse8 .cse10)))) (and (or .cse14 .cse15) (or .cse7 .cse2 .cse16) (or .cse7 .cse17 .cse2) (or .cse18 .cse14))) .cse12) (or .cse7 .cse19 .cse20)) .cse3) (or .cse13 .cse6 .cse5) (or (and (or .cse1 .cse19 .cse20) (or (let ((.cse21 (and (or .cse11 .cse22) (or .cse23 .cse2 .cse8) (or .cse22 .cse8 .cse10) (or .cse23 .cse2)))) (and (or .cse17 .cse2 .cse1) (or .cse2 .cse16 .cse1) (or .cse21 .cse15) (or .cse18 .cse21))) .cse12)) .cse3))))) (not .cse41)) (or (let ((.cse73 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_62~0#1|))))))) (let ((.cse68 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse73)))))))) (.cse69 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse72 .cse73))))) (let ((.cse42 (let ((.cse70 (and (or .cse31 .cse19) (or .cse12 (and .cse24 (or .cse29 .cse28) .cse25 (or .cse29 .cse27))))) (.cse71 (and (or .cse16 .cse69) (or .cse69 .cse18) (or .cse17 .cse69) (or .cse69 .cse15)))) (and (or .cse13 .cse34 .cse1 .cse5) (or .cse0 (and (or (and (or .cse12 (and .cse9 (or .cse7 .cse68))) (or .cse7 .cse69)) .cse3) (or .cse70 .cse5))) (or .cse0 (and (or .cse69 .cse3) (or .cse34 .cse5)) .cse1) (or (and (or (and (or .cse17 .cse1 .cse68) (or .cse22 .cse15) (or .cse22 .cse18) (or .cse16 .cse1 .cse68)) .cse12) (or .cse71 .cse1 .cse19)) .cse3) (or .cse13 .cse70 .cse5) (or (and (or .cse7 .cse71 .cse19) (or (and (or .cse7 .cse15) (or .cse7 .cse17 .cse68) (or .cse7 .cse18) (or .cse7 .cse16 .cse68)) .cse12)) .cse3)))) (.cse53 (let ((.cse66 (not .cse69))) (let ((.cse67 (and (or .cse12 (and (or .cse30 .cse27) (or .cse30 .cse28))) (or .cse32 .cse19))) (.cse65 (and (or .cse17 .cse66) (or .cse16 .cse66) (or .cse18 .cse66) (or .cse15 .cse66))) (.cse64 (not .cse68))) (and (or (and (or (and (or .cse7 .cse17 .cse64) (or .cse7 .cse16 .cse64)) .cse12) (or .cse7 .cse65 .cse19)) .cse3) (or .cse0 (and (or (and (or .cse7 .cse12 .cse64) (or .cse7 .cse66)) .cse3) (or .cse67 .cse5))) (or .cse13 .cse1 .cse33 .cse5) (or .cse13 .cse67 .cse5) (or (and (or .cse1 .cse65 .cse19) (or (and (or .cse17 .cse1 .cse64) (or .cse23 .cse15) (or .cse23 .cse18) (or .cse16 .cse1 .cse64)) .cse12)) .cse3) (or .cse0 .cse1 (and (or .cse33 .cse5) (or .cse66 .cse3))))))) (.cse46 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (let ((.cse63 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse45 .cse63)))) (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse63))))))))) (and (or .cse42 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse43 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse44 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse45 .cse43))))) (or (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse43))) .cse44) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse44 |ULTIMATE.start_main_~var_74~0#1|))))))))) (_ bv8 32))))))))))))) .cse38) (or .cse10 .cse46) (or .cse39 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse48 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse47 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse45 .cse48))))) (or (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse47 |ULTIMATE.start_main_~var_74~0#1|))))))))) (_ bv8 32)))))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse48))) .cse47)))))))) (or (and (or .cse39 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse49 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse49)))))))))))) .cse49))))))))))))) (_ bv8 32)))))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse51 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse50 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse51))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse50))))))))) .cse51))) .cse50)))) .cse10) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse52 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse52)))))))))))) .cse52))))))))))))) (_ bv8 32)))))))))) .cse38)) .cse42) (or .cse53 (and (or .cse39 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse55 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse56 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse55))))) (let ((.cse54 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse56))))))))))) (or (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse54)) (_ bv8 32)))))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse54 .cse55))) .cse56))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse58 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse59 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse58))))) (let ((.cse57 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse59))))))))))) (or (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse57 .cse58))) .cse59) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse57)) (_ bv8 32)))))))))))))) .cse38) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))))))))))) (_ bv8 32))))))))) .cse39) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))))))))))) (_ bv8 32)))))))))) .cse38))) (or .cse53 (let ((.cse61 (let ((.cse62 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse45)) (_ bv8 32)))) .cse36)))))) (and (or (not .cse62) .cse38) (or .cse39 .cse62))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (let ((.cse60 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse35 .cse60))) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse45 .cse60)))))) .cse61) (or .cse61 .cse46)))))))) .cse41)))))) is different from false [2025-03-03 18:27:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-03 18:27:14,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:27:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098204280] [2025-03-03 18:27:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098204280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:27:14,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:27:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-03-03 18:27:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019288612] [2025-03-03 18:27:14,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:27:14,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:27:14,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:27:14,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:27:14,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=77, Unknown=2, NotChecked=38, Total=156 [2025-03-03 18:27:14,724 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-03 18:27:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:15,037 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-03 18:27:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:27:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 11 [2025-03-03 18:27:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:15,039 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:27:15,039 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 18:27:15,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=67, Invalid=121, Unknown=2, NotChecked=50, Total=240 [2025-03-03 18:27:15,039 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:15,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2025-03-03 18:27:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 18:27:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-03 18:27:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-03 18:27:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-03 18:27:15,041 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2025-03-03 18:27:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-03 18:27:15,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-03 18:27:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-03 18:27:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 18:27:15,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:15,042 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-03 18:27:15,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:27:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:15,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 3 times [2025-03-03 18:27:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:27:15,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806303092] [2025-03-03 18:27:15,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 18:27:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:15,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:27:15,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:27:15,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-03-03 18:27:15,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 14 statements. [2025-03-03 18:27:15,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 18:27:15,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:15,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 18:27:15,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 18:27:16,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:27:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 18:27:19,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:27:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806303092] [2025-03-03 18:27:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806303092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:27:19,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:27:19,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 18:27:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156875633] [2025-03-03 18:27:19,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:27:19,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:27:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:27:19,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:27:19,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:27:19,583 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-03 18:27:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:19,682 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 18:27:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:19,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 14 [2025-03-03 18:27:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:19,683 INFO L225 Difference]: With dead ends: 15 [2025-03-03 18:27:19,683 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 18:27:19,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:27:19,684 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:19,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:27:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 18:27:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 18:27:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03 18:27:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 18:27:19,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-03-03 18:27:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:19,684 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 18:27:19,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-03 18:27:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 18:27:19,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 18:27:19,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:27:19,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 18:27:19,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:19,891 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-03 18:27:19,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 18:27:19,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:27:19,990 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-03 18:27:19,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:27:19 BoogieIcfgContainer [2025-03-03 18:27:19,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:27:19,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:27:19,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:27:19,995 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:27:19,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:27" (3/4) ... [2025-03-03 18:27:19,997 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 18:27:20,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 18:27:20,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 18:27:20,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 18:27:20,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 18:27:20,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 18:27:20,094 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 18:27:20,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:27:20,095 INFO L158 Benchmark]: Toolchain (without parser) took 53791.58ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 91.7MB in the beginning and 844.7MB in the end (delta: -753.0MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-03-03 18:27:20,095 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:20,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.72ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 72.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:27:20,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.76ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 68.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:27:20,097 INFO L158 Benchmark]: Boogie Preprocessor took 55.95ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:20,097 INFO L158 Benchmark]: IcfgBuilder took 458.50ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 82.1MB in the end (delta: -16.8MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-03-03 18:27:20,098 INFO L158 Benchmark]: TraceAbstraction took 52783.44ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 81.4MB in the beginning and 853.1MB in the end (delta: -771.7MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2025-03-03 18:27:20,098 INFO L158 Benchmark]: Witness Printer took 98.55ms. Allocated memory is still 939.5MB. Free memory was 853.1MB in the beginning and 844.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:27:20,100 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.13ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.72ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 72.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.76ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 68.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.95ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 458.50ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 82.1MB in the end (delta: -16.8MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 52783.44ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 81.4MB in the beginning and 853.1MB in the end (delta: -771.7MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Witness Printer took 98.55ms. Allocated memory is still 939.5MB. Free memory was 853.1MB in the beginning and 844.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.6s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 14 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 22, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 50.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 22 QuantifiedInterpolants, 60536 SizeOfPredicates, 42 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 10/48 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Location Invariant Derived location invariant: (((((((104 == var_78) && (0 == var_15)) && (1 == var_19)) && (3 == mask_SORT_11)) && (0 == var_8)) && (1 == var_74)) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2025-03-03 18:27:20,315 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 18:27:20,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE