/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 16:09:10,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 16:09:10,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 16:09:10,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 16:09:10,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 16:09:10,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 16:09:10,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 16:09:10,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 16:09:10,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 16:09:10,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 16:09:10,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 16:09:10,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 16:09:10,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 16:09:10,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 16:09:10,333 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 16:09:10,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 16:09:10,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 16:09:10,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 16:09:10,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 16:09:10,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 16:09:10,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 16:09:10,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 16:09:10,339 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 16:09:10,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 16:09:10,339 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 16:09:10,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 16:09:10,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 16:09:10,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 16:09:10,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 16:09:10,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 16:09:10,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 16:09:10,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 16:09:10,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 16:09:10,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 16:09:10,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 16:09:10,341 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 16:09:10,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 16:09:10,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 16:09:10,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 16:09:10,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 16:09:10,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 16:09:10,343 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-05 16:09:10,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 16:09:10,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 16:09:10,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 16:09:10,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 16:09:10,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 16:09:10,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2024-11-05 16:09:11,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 16:09:12,051 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 16:09:12,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2024-11-05 16:09:12,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9fca6efb/82ee6ec7c77445d08ae2585ee74201f4/FLAGf536553a2 [2024-11-05 16:09:12,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9fca6efb/82ee6ec7c77445d08ae2585ee74201f4 [2024-11-05 16:09:12,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 16:09:12,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 16:09:12,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 16:09:12,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 16:09:12,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 16:09:12,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366c71af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12, skipping insertion in model container [2024-11-05 16:09:12,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 16:09:12,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2024-11-05 16:09:12,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 16:09:12,314 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 16:09:12,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2024-11-05 16:09:12,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 16:09:12,395 INFO L204 MainTranslator]: Completed translation [2024-11-05 16:09:12,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12 WrapperNode [2024-11-05 16:09:12,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 16:09:12,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 16:09:12,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 16:09:12,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 16:09:12,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,449 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 466 [2024-11-05 16:09:12,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 16:09:12,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 16:09:12,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 16:09:12,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 16:09:12,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,540 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]. [2024-11-05 16:09:12,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 16:09:12,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 16:09:12,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 16:09:12,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 16:09:12,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (1/1) ... [2024-11-05 16:09:12,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 16:09:12,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 16:09:12,604 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) [2024-11-05 16:09:12,608 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 [2024-11-05 16:09:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 16:09:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 16:09:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 16:09:12,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 16:09:12,772 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 16:09:12,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 16:09:13,044 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-05 16:09:13,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 16:09:13,054 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 16:09:13,055 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 16:09:13,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:09:13 BoogieIcfgContainer [2024-11-05 16:09:13,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 16:09:13,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 16:09:13,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 16:09:13,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 16:09:13,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 04:09:12" (1/3) ... [2024-11-05 16:09:13,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f5e9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:09:13, skipping insertion in model container [2024-11-05 16:09:13,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:09:12" (2/3) ... [2024-11-05 16:09:13,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f5e9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:09:13, skipping insertion in model container [2024-11-05 16:09:13,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:09:13" (3/3) ... [2024-11-05 16:09:13,063 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2024-11-05 16:09:13,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 16:09:13,075 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 16:09:13,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 16:09:13,119 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;@4bb7755f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 16:09:13,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 16:09:13,122 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) [2024-11-05 16:09:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 16:09:13,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 16:09:13,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 16:09:13,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 16:09:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 16:09:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 16:09:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 16:09:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118095449] [2024-11-05 16:09:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 16:09:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 16:09:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 16:09:13,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 16:09:13,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-05 16:09:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 16:09:13,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-05 16:09:13,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 16:09:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 16:09:13,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 16:09:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 16:09:13,651 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 16:09:13,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118095449] [2024-11-05 16:09:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2118095449] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 16:09:13,652 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 16:09:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 16:09:13,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275365662] [2024-11-05 16:09:13,653 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 16:09:13,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 16:09:13,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 16:09:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 16:09:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 16:09:13,672 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 16:09:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 16:09:13,718 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-05 16:09:13,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 16:09:13,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-05 16:09:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 16:09:13,733 INFO L225 Difference]: With dead ends: 18 [2024-11-05 16:09:13,737 INFO L226 Difference]: Without dead ends: 10 [2024-11-05 16:09:13,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 16:09:13,741 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 16:09:13,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 16:09:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-05 16:09:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-05 16:09:13,765 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) [2024-11-05 16:09:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 16:09:13,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 16:09:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 16:09:13,766 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 16:09:13,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 16:09:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 16:09:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 16:09:13,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 16:09:13,767 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 16:09:13,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Forceful destruction successful, exit code 0 [2024-11-05 16:09:13,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 16:09:13,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 16:09:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 16:09:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 16:09:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 16:09:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637302124] [2024-11-05 16:09:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 16:09:13,971 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 16:09:13,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 16:09:13,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 16:09:13,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-05 16:09:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 16:09:14,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-05 16:09:14,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 16:09:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 16:09:14,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 16:09:50,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse66 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|))) (let ((.cse49 (= |c_ULTIMATE.start_main_~state_40~0#1| (_ bv0 8))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse62 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse66))))) (.cse65 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_21~0#1|))) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse65))))) (.cse46 (= .cse66 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|))) (.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse62)))) (.cse41 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse65))))))) (.cse44 (not .cse49)) (.cse18 (= |c_ULTIMATE.start_main_~state_71~0#1| (_ bv0 8)))) (let ((.cse20 (not .cse18)) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_14~0#1|)))))) (.cse11 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse3 ((_ 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) |c_ULTIMATE.start_main_~state_65~0#1|))))))))))))) (.cse51 (or (= (_ bv0 32) |c_ULTIMATE.start_main_~var_12~0#1|) .cse41 .cse44 (not (= (_ bv0 32) .cse66)))) (.cse40 (= |c_ULTIMATE.start_main_~var_12~0#1| .cse53)) (.cse45 (not .cse46)) (.cse47 (forall ((|ULTIMATE.start_main_~input_73~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_73~0#1|))))) .cse2)))))) (.cse48 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|))) .cse2))))) (.cse43 (= ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse65))))) (_ bv0 8))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) .cse60)))) (let ((.cse6 (let ((.cse64 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse22))))))))) (let ((.cse63 (or (and (or .cse64 .cse41 .cse48) .cse43) .cse49))) (and (or (and .cse63 (or (and (or .cse64 .cse40 .cse41) .cse43) .cse44)) .cse45) (or .cse46 (and .cse63 (or .cse44 (and (or .cse64 .cse41 .cse47) .cse43)))))))) (.cse17 (let ((.cse61 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse62))))))))))))) (and (or (and (or .cse61 .cse41 .cse47) .cse43) .cse44) .cse51 (or (and (or .cse61 .cse41 .cse48) .cse43) .cse49)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse60)))) (.cse30 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse59)))))) (= (_ 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_~input_81~0#1|)))))))) .cse59))) .cse2))))))) (.cse26 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (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_~input_81~0#1|)))))))) .cse58))) .cse2)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse58)))))))))) (.cse38 (not .cse11)) (.cse34 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse57))))))) (= (_ 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_~input_81~0#1|)))))))) .cse57))) .cse2))))))) (.cse33 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse56))))))) (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_~input_81~0#1|)))))))) .cse56))) .cse2)))))))) (.cse37 (and (or (let ((.cse52 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse53)))))) (and .cse51 (or (and (or .cse52 .cse41 .cse48) .cse43) .cse49) (or (and (or .cse52 .cse41 .cse47) .cse43) .cse44))) .cse18) (or .cse20 (let ((.cse54 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse50))))))))) (let ((.cse55 (or (and .cse43 (or .cse41 .cse48 .cse54)) .cse49))) (and (or .cse45 (and (or (and .cse43 (or .cse40 .cse41 .cse54)) .cse44) .cse55)) (or .cse46 (and (or (and (or .cse41 .cse47 .cse54) .cse43) .cse44) .cse55))))))))) (let ((.cse23 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse0 (or .cse38 (and (or .cse34 .cse37) (or .cse33 .cse37)))) (.cse19 (let ((.cse42 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse50)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (let ((.cse39 (or (and .cse43 (or .cse41 .cse48 .cse42)) .cse49))) (and (or (and .cse39 (or (and (or .cse40 .cse41 .cse42) .cse43) .cse44)) .cse45) (or .cse46 (and .cse39 (or (and .cse43 (or .cse41 .cse47 .cse42)) .cse44))))))) (.cse21 (or (and (or .cse37 .cse30) (or .cse37 .cse26)) .cse38)) (.cse1 (or .cse17 .cse18 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 .cse25)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse36))))))) (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_~input_81~0#1|)))))))) .cse36))) .cse2))))))))) (.cse7 (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 .cse25)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse35))))))) (= (_ 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_~input_81~0#1|)))))))) .cse35))) .cse2)))))) .cse18)) (.cse8 (or .cse34 .cse20 .cse6)) (.cse10 (or .cse33 .cse20 .cse6))) (and (or (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))))) (and .cse0 (or (and .cse1 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse4))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse4))))))) (= (_ 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_~input_81~0#1|)))))))) .cse4))) .cse2)))))) .cse6) .cse7 .cse8 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse9))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse9))))))) (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_~input_81~0#1|)))))))) .cse9))) .cse2))))))) .cse6) .cse10) .cse11) (or (let ((.cse14 (and (or .cse17 .cse18) (or .cse19 .cse20)))) (and (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse12))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse12)))))) (= (_ 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_~input_81~0#1|)))))))) .cse12))) .cse2)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse13))))))) (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_~input_81~0#1|)))))))) .cse13))) .cse2)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse13))))))))) .cse6) (or .cse14 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse15)))))) (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_~input_81~0#1|)))))))) .cse15))) .cse2)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse15)))))))))) (or .cse14 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse16)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse16)))))) (= (_ 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_~input_81~0#1|)))))))) .cse16))) .cse2))))))))) .cse11) .cse21)) .cse23) (or (not .cse23) (and .cse0 (or (and (or .cse18 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse24 .cse25))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse24)))))) (= (_ 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_~input_81~0#1|)))))))) .cse24))) .cse2)))))) .cse6) (or .cse19 .cse26 .cse20) (or .cse17 .cse18 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse27 .cse25)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse27)))))) (= (_ 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_~input_81~0#1|)))))))) .cse27))) .cse2))))))) (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse25)))))) (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_~input_81~0#1|)))))))) .cse28))) .cse2)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse28))))))))) .cse18) (or .cse18 .cse6 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse29 .cse25))))))) (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_~input_81~0#1|)))))))) .cse29))) .cse2)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse29)))))))))) (or .cse19 .cse20 .cse30)) .cse11) .cse21 (or .cse11 (and .cse1 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 .cse25))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse31))))))) (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_~input_81~0#1|)))))))) .cse31))) .cse2))))))) .cse18 .cse6) .cse7 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_81~0#1| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse32 .cse25))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse32))))))) (= (_ 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_~input_81~0#1|)))))))) .cse32))) .cse2)))))) .cse18 .cse6) .cse8 .cse10))))))))))) is different from false [2024-11-05 16:10:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-05 16:10:11,083 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 16:10:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637302124] [2024-11-05 16:10:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [637302124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 16:10:11,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 16:10:11,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 16:10:11,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957746393] [2024-11-05 16:10:11,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 16:10:11,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 16:10:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 16:10:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 16:10:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-05 16:10:11,086 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-05 16:10:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 16:10:11,448 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-05 16:10:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 16:10:11,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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 [2024-11-05 16:10:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 16:10:11,449 INFO L225 Difference]: With dead ends: 15 [2024-11-05 16:10:11,449 INFO L226 Difference]: Without dead ends: 13 [2024-11-05 16:10:11,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-05 16:10:11,450 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 16:10:11,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2024-11-05 16:10:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-05 16:10:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-05 16:10:11,453 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) [2024-11-05 16:10:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-05 16:10:11,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-05 16:10:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 16:10:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-05 16:10:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-05 16:10:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-05 16:10:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 16:10:11,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 16:10:11,454 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-05 16:10:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-05 16:10:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 16:10:11,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 16:10:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 16:10:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-05 16:10:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 16:10:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832684377] [2024-11-05 16:10:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 16:10:11,658 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 16:10:11,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 16:10:11,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 16:10:11,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-05 16:10:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 16:10:11,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-05 16:10:11,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 16:10:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 16:10:13,144 INFO L311 TraceCheckSpWp]: Computing backward predicates...