/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.synabs2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 22:22:37,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 22:22:37,532 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-01 22:22:37,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 22:22:37,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 22:22:37,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 22:22:37,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 22:22:37,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 22:22:37,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 22:22:37,589 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 22:22:37,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 22:22:37,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 22:22:37,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 22:22:37,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 22:22:37,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 22:22:37,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 22:22:37,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 22:22:37,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 22:22:37,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 22:22:37,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 22:22:37,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 22:22:37,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 22:22:37,595 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 22:22:37,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 22:22:37,596 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 22:22:37,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 22:22:37,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 22:22:37,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 22:22:37,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 22:22:37,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 22:22:37,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 22:22:37,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 22:22:37,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 22:22:37,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 22:22:37,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 22:22:37,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 22:22:37,600 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 22:22:37,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 22:22:37,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 22:22:37,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 22:22:37,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 22:22:37,601 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 22:22:37,601 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-01 22:22:37,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 22:22:37,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 22:22:37,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 22:22:37,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 22:22:37,952 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 22:22:37,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-11-01 22:22:39,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 22:22:39,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 22:22:39,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-11-01 22:22:39,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970a9ffd5/19935a921eb44e22b2451f5a90acf6ec/FLAG10be50c55 [2024-11-01 22:22:39,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970a9ffd5/19935a921eb44e22b2451f5a90acf6ec [2024-11-01 22:22:39,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 22:22:39,943 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 22:22:39,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 22:22:39,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 22:22:39,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 22:22:39,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:22:39" (1/1) ... [2024-11-01 22:22:39,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f65359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:39, skipping insertion in model container [2024-11-01 22:22:39,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:22:39" (1/1) ... [2024-11-01 22:22:39,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 22:22:40,154 WARN L251 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.synabs2.c[1247,1260] [2024-11-01 22:22:40,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 22:22:40,208 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 22:22:40,218 WARN L251 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.synabs2.c[1247,1260] [2024-11-01 22:22:40,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 22:22:40,262 INFO L204 MainTranslator]: Completed translation [2024-11-01 22:22:40,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40 WrapperNode [2024-11-01 22:22:40,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 22:22:40,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 22:22:40,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 22:22:40,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 22:22:40,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,305 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-11-01 22:22:40,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 22:22:40,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 22:22:40,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 22:22:40,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 22:22:40,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,335 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-01 22:22:40,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 22:22:40,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 22:22:40,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 22:22:40,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 22:22:40,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (1/1) ... [2024-11-01 22:22:40,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 22:22:40,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 22:22:40,379 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-01 22:22:40,382 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-01 22:22:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 22:22:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 22:22:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 22:22:40,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 22:22:40,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 22:22:40,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 22:22:40,662 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-01 22:22:40,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 22:22:40,675 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 22:22:40,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 22:22:40,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:22:40 BoogieIcfgContainer [2024-11-01 22:22:40,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 22:22:40,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 22:22:40,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 22:22:40,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 22:22:40,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 10:22:39" (1/3) ... [2024-11-01 22:22:40,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edbb70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:22:40, skipping insertion in model container [2024-11-01 22:22:40,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:22:40" (2/3) ... [2024-11-01 22:22:40,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edbb70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:22:40, skipping insertion in model container [2024-11-01 22:22:40,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:22:40" (3/3) ... [2024-11-01 22:22:40,687 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-11-01 22:22:40,700 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 22:22:40,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 22:22:40,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 22:22:40,754 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;@54da992a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 22:22:40,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 22:22:40,759 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-01 22:22:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 22:22:40,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 22:22:40,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 22:22:40,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 22:22:40,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 22:22:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 22:22:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 22:22:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643415811] [2024-11-01 22:22:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 22:22:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 22:22:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:40,779 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-01 22:22:40,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-01 22:22:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 22:22:40,864 WARN L253 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-01 22:22:40,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 22:22:41,129 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-01 22:22:41,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 22:22:41,281 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-01 22:22:41,282 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 22:22:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643415811] [2024-11-01 22:22:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [643415811] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 22:22:41,283 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 22:22:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 22:22:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729972446] [2024-11-01 22:22:41,286 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 22:22:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 22:22:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 22:22:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 22:22:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 22:22:41,313 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-01 22:22:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 22:22:41,366 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-01 22:22:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 22:22:41,374 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-01 22:22:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 22:22:41,380 INFO L225 Difference]: With dead ends: 18 [2024-11-01 22:22:41,380 INFO L226 Difference]: Without dead ends: 10 [2024-11-01 22:22:41,382 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-01 22:22:41,387 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-01 22:22:41,388 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-01 22:22:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-01 22:22:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-01 22:22:41,414 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-01 22:22:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 22:22:41,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 22:22:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 22:22:41,416 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 22:22:41,416 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-01 22:22:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 22:22:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 22:22:41,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 22:22:41,417 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 22:22:41,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Forceful destruction successful, exit code 0 [2024-11-01 22:22:41,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:41,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 22:22:41,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 22:22:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 22:22:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 22:22:41,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207194819] [2024-11-01 22:22:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 22:22:41,621 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 22:22:41,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:41,623 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-01 22:22:41,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-01 22:22:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 22:22:41,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-01 22:22:41,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 22:22:41,881 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-01 22:22:41,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 22:22:42,073 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-01 22:22:42,074 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 22:22:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207194819] [2024-11-01 22:22:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [207194819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 22:22:42,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 22:22:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-01 22:22:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728601790] [2024-11-01 22:22:42,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 22:22:42,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-01 22:22:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 22:22:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-01 22:22:42,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-01 22:22:42,080 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-01 22:22:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 22:22:42,238 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-01 22:22:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-01 22:22:42,238 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-01 22:22:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 22:22:42,239 INFO L225 Difference]: With dead ends: 18 [2024-11-01 22:22:42,239 INFO L226 Difference]: Without dead ends: 16 [2024-11-01 22:22:42,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-01 22:22:42,240 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 22:22:42,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 22:22:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-01 22:22:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-01 22:22:42,245 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) [2024-11-01 22:22:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 22:22:42,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-01 22:22:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 22:22:42,246 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 22:22:42,246 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-01 22:22:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 22:22:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 22:22:42,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 22:22:42,247 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 22:22:42,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-01 22:22:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:42,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 22:22:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 22:22:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-01 22:22:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 22:22:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474585471] [2024-11-01 22:22:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 22:22:42,450 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 22:22:42,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:42,451 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-01 22:22:42,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-01 22:22:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 22:22:42,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-01 22:22:42,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 22:22:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 22:22:42,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 22:22:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 22:22:43,191 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 22:22:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474585471] [2024-11-01 22:22:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [474585471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 22:22:43,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 22:22:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-01 22:22:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767620996] [2024-11-01 22:22:43,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 22:22:43,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-01 22:22:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 22:22:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-01 22:22:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-01 22:22:43,194 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-01 22:22:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 22:22:43,772 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-01 22:22:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-01 22:22:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 [2024-11-01 22:22:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 22:22:43,774 INFO L225 Difference]: With dead ends: 30 [2024-11-01 22:22:43,774 INFO L226 Difference]: Without dead ends: 28 [2024-11-01 22:22:43,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-01 22:22:43,775 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 22:22:43,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 22:22:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-01 22:22:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-01 22:22:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-01 22:22:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-01 22:22:43,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-01 22:22:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 22:22:43,782 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-01 22:22:43,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-01 22:22:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-01 22:22:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-01 22:22:43,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 22:22:43,783 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-01 22:22:43,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-01 22:22:43,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:43,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 22:22:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 22:22:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-01 22:22:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 22:22:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247038811] [2024-11-01 22:22:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 22:22:43,986 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 22:22:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:43,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 22:22:43,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-01 22:22:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 22:22:44,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-01 22:22:44,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 22:22:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 22:22:44,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 22:22:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 22:22:45,714 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 22:22:45,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247038811] [2024-11-01 22:22:45,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1247038811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 22:22:45,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 22:22:45,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-01 22:22:45,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350472238] [2024-11-01 22:22:45,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 22:22:45,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-01 22:22:45,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 22:22:45,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-01 22:22:45,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-01 22:22:45,720 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-01 22:22:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 22:22:47,187 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-01 22:22:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-01 22:22:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 26 [2024-11-01 22:22:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 22:22:47,191 INFO L225 Difference]: With dead ends: 48 [2024-11-01 22:22:47,191 INFO L226 Difference]: Without dead ends: 46 [2024-11-01 22:22:47,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=392, Invalid=1014, Unknown=0, NotChecked=0, Total=1406 [2024-11-01 22:22:47,193 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-01 22:22:47,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 38 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-01 22:22:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-01 22:22:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-11-01 22:22:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-01 22:22:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2024-11-01 22:22:47,203 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2024-11-01 22:22:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 22:22:47,204 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2024-11-01 22:22:47,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-01 22:22:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2024-11-01 22:22:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-01 22:22:47,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 22:22:47,205 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2024-11-01 22:22:47,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Forceful destruction successful, exit code 0 [2024-11-01 22:22:47,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:47,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 22:22:47,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 22:22:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1558545309, now seen corresponding path program 4 times [2024-11-01 22:22:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 22:22:47,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627669191] [2024-11-01 22:22:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 22:22:47,407 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 22:22:47,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:47,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 22:22:47,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Waiting until timeout for monitored process [2024-11-01 22:22:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 22:22:47,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 22:22:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 22:22:47,686 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 22:22:47,686 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 22:22:47,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 22:22:47,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Ended with exit code 0 [2024-11-01 22:22:47,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 22:22:47,894 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-01 22:22:47,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 22:22:47,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 10:22:47 BoogieIcfgContainer [2024-11-01 22:22:47,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 22:22:47,949 INFO L158 Benchmark]: Toolchain (without parser) took 8006.14ms. Allocated memory was 194.0MB in the beginning and 250.6MB in the end (delta: 56.6MB). Free memory was 157.4MB in the beginning and 89.1MB in the end (delta: 68.3MB). Peak memory consumption was 125.9MB. Max. memory is 8.0GB. [2024-11-01 22:22:47,950 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 22:22:47,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.85ms. Allocated memory is still 194.0MB. Free memory was 156.8MB in the beginning and 143.2MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 22:22:47,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.24ms. Allocated memory is still 194.0MB. Free memory was 143.2MB in the beginning and 141.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 22:22:47,950 INFO L158 Benchmark]: Boogie Preprocessor took 38.73ms. Allocated memory is still 194.0MB. Free memory was 141.1MB in the beginning and 139.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 22:22:47,951 INFO L158 Benchmark]: RCFGBuilder took 330.57ms. Allocated memory is still 194.0MB. Free memory was 139.0MB in the beginning and 126.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-01 22:22:47,951 INFO L158 Benchmark]: TraceAbstraction took 7269.33ms. Allocated memory was 194.0MB in the beginning and 250.6MB in the end (delta: 56.6MB). Free memory was 125.9MB in the beginning and 89.1MB in the end (delta: 36.8MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2024-11-01 22:22:47,953 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.15ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.85ms. Allocated memory is still 194.0MB. Free memory was 156.8MB in the beginning and 143.2MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.24ms. Allocated memory is still 194.0MB. Free memory was 143.2MB in the beginning and 141.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.73ms. Allocated memory is still 194.0MB. Free memory was 141.1MB in the beginning and 139.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 330.57ms. Allocated memory is still 194.0MB. Free memory was 139.0MB in the beginning and 126.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7269.33ms. Allocated memory was 194.0MB in the beginning and 250.6MB in the end (delta: 56.6MB). Free memory was 125.9MB in the beginning and 89.1MB in the end (delta: 36.8MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 355 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 16 mSDtfsCounter, 355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 56, 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, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 4810 SizeOfPredicates, 22 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/188 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-01 22:22:47,978 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...