/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 'cvc5 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 03:37:16,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 03:37:16,586 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 03:37:16,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 03:37:16,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 03:37:16,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 03:37:16,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 03:37:16,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 03:37:16,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 03:37:16,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 03:37:16,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 03:37:16,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 03:37:16,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 03:37:16,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 03:37:16,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 03:37:16,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 03:37:16,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 03:37:16,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 03:37:16,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 03:37:16,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 03:37:16,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 03:37:16,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 03:37:16,633 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 03:37:16,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 03:37:16,634 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 03:37:16,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 03:37:16,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 03:37:16,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 03:37:16,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 03:37:16,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 03:37:16,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 03:37:16,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 03:37:16,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 03:37:16,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 03:37:16,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 03:37:16,636 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 03:37:16,637 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 03:37:16,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 03:37:16,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 03:37:16,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 03:37:16,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 03:37:16,638 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 -> cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:16,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 03:37:16,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 03:37:16,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 03:37:16,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 03:37:16,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 03:37:16,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-05 03:37:18,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 03:37:18,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 03:37:18,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-05 03:37:18,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a6e1dd5/98fd24c3c48e4fc6a1347e2415b48fdb/FLAG4a6a1ee93 [2024-11-05 03:37:18,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a6e1dd5/98fd24c3c48e4fc6a1347e2415b48fdb [2024-11-05 03:37:18,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 03:37:18,458 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 03:37:18,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 03:37:18,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 03:37:18,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 03:37:18,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29628353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18, skipping insertion in model container [2024-11-05 03:37:18,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 03:37:18,645 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.dyn_partition.c[1253,1266] [2024-11-05 03:37:18,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 03:37:18,690 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 03:37:18,700 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.dyn_partition.c[1253,1266] [2024-11-05 03:37:18,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 03:37:18,733 INFO L204 MainTranslator]: Completed translation [2024-11-05 03:37:18,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18 WrapperNode [2024-11-05 03:37:18,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 03:37:18,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 03:37:18,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 03:37:18,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 03:37:18,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,769 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-05 03:37:18,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 03:37:18,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 03:37:18,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 03:37:18,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 03:37:18,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,793 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 03:37:18,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 03:37:18,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 03:37:18,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 03:37:18,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 03:37:18,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (1/1) ... [2024-11-05 03:37:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 03:37:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 03:37:18,841 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 03:37:18,848 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 03:37:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 03:37:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 03:37:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 03:37:18,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 03:37:18,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 03:37:18,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 03:37:19,187 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-05 03:37:19,187 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 03:37:19,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 03:37:19,200 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 03:37:19,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 03:37:19 BoogieIcfgContainer [2024-11-05 03:37:19,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 03:37:19,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 03:37:19,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 03:37:19,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 03:37:19,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 03:37:18" (1/3) ... [2024-11-05 03:37:19,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afd8931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 03:37:19, skipping insertion in model container [2024-11-05 03:37:19,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:37:18" (2/3) ... [2024-11-05 03:37:19,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afd8931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 03:37:19, skipping insertion in model container [2024-11-05 03:37:19,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 03:37:19" (3/3) ... [2024-11-05 03:37:19,210 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-05 03:37:19,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 03:37:19,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 03:37:19,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 03:37:19,278 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;@7f442292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 03:37:19,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 03:37:19,281 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 03:37:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 03:37:19,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:37:19,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 03:37:19,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:37:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:37:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 03:37:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:37:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1891434035] [2024-11-05 03:37:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:37:19,299 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:37:19,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:37:19,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-05 03:37:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:37:19,394 WARN L253 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-05 03:37:19,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:37:19,624 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 03:37:19,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:37:19,745 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 03:37:19,746 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:37:19,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1891434035] [2024-11-05 03:37:19,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1891434035] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 03:37:19,747 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 03:37:19,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 03:37:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462295247] [2024-11-05 03:37:19,750 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 03:37:19,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 03:37:19,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:37:19,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 03:37:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 03:37:19,778 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 03:37:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:37:19,828 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-05 03:37:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 03:37:19,830 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 03:37:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:37:19,837 INFO L225 Difference]: With dead ends: 18 [2024-11-05 03:37:19,837 INFO L226 Difference]: Without dead ends: 10 [2024-11-05 03:37:19,840 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 03:37:19,844 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 03:37:19,846 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 03:37:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-05 03:37:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-05 03:37:19,870 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 03:37:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 03:37:19,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 03:37:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:37:19,872 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 03:37:19,872 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 03:37:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 03:37:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 03:37:19,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:37:19,873 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 03:37:19,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-05 03:37:20,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:20,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:37:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:37:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 03:37:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:37:20,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1878289466] [2024-11-05 03:37:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:37:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:37:20,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:37:20,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-05 03:37:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:37:20,166 WARN L253 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-05 03:37:20,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:37:20,504 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 03:37:20,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:37:20,948 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 03:37:20,949 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:37:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1878289466] [2024-11-05 03:37:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1878289466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:37:20,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:37:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 03:37:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785093928] [2024-11-05 03:37:20,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:37:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 03:37:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:37:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 03:37:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 03:37:20,954 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 03:37:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:37:21,121 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-05 03:37:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 03:37:21,122 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 03:37:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:37:21,123 INFO L225 Difference]: With dead ends: 18 [2024-11-05 03:37:21,123 INFO L226 Difference]: Without dead ends: 16 [2024-11-05 03:37:21,123 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-05 03:37:21,124 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.0s IncrementalHoareTripleChecker+Time [2024-11-05 03:37:21,125 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.0s Time] [2024-11-05 03:37:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-05 03:37:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-05 03:37:21,129 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-05 03:37:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-05 03:37:21,129 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-05 03:37:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:37:21,130 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-05 03:37:21,130 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 03:37:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-05 03:37:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 03:37:21,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:37:21,132 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-05 03:37:21,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-11-05 03:37:21,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:21,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:37:21,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:37:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-05 03:37:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:37:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106059217] [2024-11-05 03:37:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:37:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:37:21,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:37:21,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-05 03:37:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:37:21,439 WARN L253 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-05 03:37:21,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:37:21,890 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-05 03:37:21,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:37:23,726 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-05 03:37:23,726 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:37:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106059217] [2024-11-05 03:37:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2106059217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:37:23,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:37:23,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-05 03:37:23,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316300127] [2024-11-05 03:37:23,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:37:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 03:37:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:37:23,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 03:37:23,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-05 03:37:23,729 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-05 03:37:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:37:24,597 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-05 03:37:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 03:37:24,598 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-05 03:37:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:37:24,598 INFO L225 Difference]: With dead ends: 30 [2024-11-05 03:37:24,598 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 03:37:24,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-05 03:37:24,600 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-05 03:37:24,600 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-05 03:37:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 03:37:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-05 03:37:24,606 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-05 03:37:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-05 03:37:24,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-05 03:37:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:37:24,609 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-05 03:37:24,609 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-05 03:37:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-05 03:37:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 03:37:24,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:37:24,609 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-05 03:37:24,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-05 03:37:24,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:24,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:37:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:37:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-05 03:37:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:37:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1118888718] [2024-11-05 03:37:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:37:24,812 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:37:24,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:37:24,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-05 03:37:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:37:24,973 WARN L253 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-05 03:37:24,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:37:25,844 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-05 03:37:25,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:37:32,021 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-05 03:37:32,022 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:37:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1118888718] [2024-11-05 03:37:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1118888718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:37:32,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:37:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-05 03:37:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673942287] [2024-11-05 03:37:32,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:37:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-05 03:37:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:37:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-05 03:37:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-05 03:37:32,024 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-05 03:37:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:37:37,581 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-05 03:37:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 03:37:37,582 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-05 03:37:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:37:37,583 INFO L225 Difference]: With dead ends: 54 [2024-11-05 03:37:37,583 INFO L226 Difference]: Without dead ends: 52 [2024-11-05 03:37:37,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=515, Invalid=1207, Unknown=0, NotChecked=0, Total=1722 [2024-11-05 03:37:37,585 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 03:37:37,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 03:37:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-05 03:37:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-05 03:37:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 03:37:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-05 03:37:37,599 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-11-05 03:37:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:37:37,599 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-05 03:37:37,600 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-05 03:37:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-05 03:37:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 03:37:37,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:37:37,601 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-05 03:37:37,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-05 03:37:37,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:37,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:37:37,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:37:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 4 times [2024-11-05 03:37:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:37:37,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336033125] [2024-11-05 03:37:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:37:37,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:37:37,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:37:37,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-05 03:37:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 03:37:37,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 03:37:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 03:37:38,237 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 03:37:38,237 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 03:37:38,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 03:37:38,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-05 03:37:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:37:38,443 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-05 03:37:38,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 03:37:38,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 03:37:38 BoogieIcfgContainer [2024-11-05 03:37:38,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 03:37:38,513 INFO L158 Benchmark]: Toolchain (without parser) took 20055.11ms. Allocated memory was 340.8MB in the beginning and 849.3MB in the end (delta: 508.6MB). Free memory was 293.2MB in the beginning and 626.1MB in the end (delta: -333.0MB). Peak memory consumption was 176.0MB. Max. memory is 8.0GB. [2024-11-05 03:37:38,513 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 205.5MB. Free memory was 158.1MB in the beginning and 157.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 03:37:38,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.38ms. Allocated memory is still 340.8MB. Free memory was 293.2MB in the beginning and 278.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 03:37:38,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.11ms. Allocated memory is still 340.8MB. Free memory was 278.4MB in the beginning and 276.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 03:37:38,514 INFO L158 Benchmark]: Boogie Preprocessor took 35.26ms. Allocated memory is still 340.8MB. Free memory was 276.4MB in the beginning and 274.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 03:37:38,514 INFO L158 Benchmark]: RCFGBuilder took 394.00ms. Allocated memory is still 340.8MB. Free memory was 274.3MB in the beginning and 259.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 03:37:38,515 INFO L158 Benchmark]: TraceAbstraction took 19309.87ms. Allocated memory was 340.8MB in the beginning and 849.3MB in the end (delta: 508.6MB). Free memory was 258.6MB in the beginning and 626.1MB in the end (delta: -367.6MB). Peak memory consumption was 141.4MB. Max. memory is 8.0GB. [2024-11-05 03:37:38,516 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.16ms. Allocated memory is still 205.5MB. Free memory was 158.1MB in the beginning and 157.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.38ms. Allocated memory is still 340.8MB. Free memory was 293.2MB in the beginning and 278.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.11ms. Allocated memory is still 340.8MB. Free memory was 278.4MB in the beginning and 276.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.26ms. Allocated memory is still 340.8MB. Free memory was 276.4MB in the beginning and 274.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.00ms. Allocated memory is still 340.8MB. Free memory was 274.3MB in the beginning and 259.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19309.87ms. Allocated memory was 340.8MB in the beginning and 849.3MB in the end (delta: 508.6MB). Free memory was 258.6MB in the beginning and 626.1MB in the end (delta: -367.6MB). Peak memory consumption was 141.4MB. 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 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [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_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_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: 19.2s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 16 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 60, 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.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 18007 SizeOfPredicates, 43 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 281 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-05 03:37:38,556 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...