/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 'z3 -smt2 -in SMTLIB2_COMPLIANT=true' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 05:27:54,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 05:27:54,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 05:27:54,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 05:27:54,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 05:27:54,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 05:27:54,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 05:27:54,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 05:27:54,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 05:27:54,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 05:27:54,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 05:27:54,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 05:27:54,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 05:27:54,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 05:27:54,422 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 05:27:54,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 05:27:54,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 05:27:54,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 05:27:54,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 05:27:54,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 05:27:54,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 05:27:54,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 05:27:54,425 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 05:27:54,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 05:27:54,425 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 05:27:54,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 05:27:54,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 05:27:54,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 05:27:54,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 05:27:54,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 05:27:54,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 05:27:54,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 05:27:54,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 05:27:54,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 05:27:54,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 05:27:54,428 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 05:27:54,428 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 05:27:54,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 05:27:54,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 05:27:54,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 05:27:54,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 05:27:54,432 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 05:27:54,432 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 -> z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:27:54,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 05:27:54,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 05:27:54,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 05:27:54,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 05:27:54,773 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 05:27:54,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c [2024-11-01 05:27:56,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 05:27:56,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 05:27:56,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c [2024-11-01 05:27:56,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4625f24/2cf5d52035ab44399841f5dd52c084b3/FLAGe669a9c43 [2024-11-01 05:27:56,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4625f24/2cf5d52035ab44399841f5dd52c084b3 [2024-11-01 05:27:56,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 05:27:56,877 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 05:27:56,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 05:27:56,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 05:27:56,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 05:27:56,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:27:56" (1/1) ... [2024-11-01 05:27:56,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d6ae63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:56, skipping insertion in model container [2024-11-01 05:27:56,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:27:56" (1/1) ... [2024-11-01 05:27:56,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 05:27:57,056 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2024-11-01 05:27:57,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 05:27:57,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 05:27:57,109 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2024-11-01 05:27:57,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 05:27:57,141 INFO L204 MainTranslator]: Completed translation [2024-11-01 05:27:57,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57 WrapperNode [2024-11-01 05:27:57,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 05:27:57,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 05:27:57,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 05:27:57,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 05:27:57,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,175 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-11-01 05:27:57,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 05:27:57,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 05:27:57,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 05:27:57,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 05:27:57,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,203 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-01 05:27:57,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 05:27:57,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 05:27:57,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 05:27:57,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 05:27:57,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (1/1) ... [2024-11-01 05:27:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 05:27:57,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 05:27:57,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-01 05:27:57,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-01 05:27:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 05:27:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 05:27:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 05:27:57,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 05:27:57,357 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 05:27:57,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 05:27:57,516 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-01 05:27:57,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 05:27:57,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 05:27:57,539 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 05:27:57,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:27:57 BoogieIcfgContainer [2024-11-01 05:27:57,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 05:27:57,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 05:27:57,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 05:27:57,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 05:27:57,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 05:27:56" (1/3) ... [2024-11-01 05:27:57,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c5d14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:27:57, skipping insertion in model container [2024-11-01 05:27:57,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:27:57" (2/3) ... [2024-11-01 05:27:57,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c5d14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:27:57, skipping insertion in model container [2024-11-01 05:27:57,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:27:57" (3/3) ... [2024-11-01 05:27:57,551 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2024-11-01 05:27:57,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 05:27:57,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 05:27:57,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 05:27:57,625 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;@3e94471a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 05:27:57,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 05:27:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 05:27:57,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 05:27:57,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 05:27:57,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 05:27:57,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 05:27:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 05:27:57,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 05:27:57,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756585138] [2024-11-01 05:27:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 05:27:57,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:27:57,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 05:27:57,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-01 05:27:57,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-01 05:27:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 05:27:57,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-01 05:27:57,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 05:27:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:27:57,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 05:27:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:27:58,020 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 05:27:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756585138] [2024-11-01 05:27:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [756585138] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 05:27:58,021 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 05:27:58,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 05:27:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177292434] [2024-11-01 05:27:58,024 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 05:27:58,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 05:27:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 05:27:58,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 05:27:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 05:27:58,075 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 05:27:58,195 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-01 05:27:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 05:27:58,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-01 05:27:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 05:27:58,211 INFO L225 Difference]: With dead ends: 18 [2024-11-01 05:27:58,211 INFO L226 Difference]: Without dead ends: 10 [2024-11-01 05:27:58,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-01 05:27:58,218 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.1s IncrementalHoareTripleChecker+Time [2024-11-01 05:27:58,219 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.1s Time] [2024-11-01 05:27:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-01 05:27:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-01 05:27:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 05:27:58,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 05:27:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 05:27:58,246 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 05:27:58,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 05:27:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 05:27:58,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 05:27:58,248 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 05:27:58,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-01 05:27:58,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:27:58,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 05:27:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 05:27:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 05:27:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 05:27:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824387299] [2024-11-01 05:27:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 05:27:58,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:27:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 05:27:58,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-01 05:27:58,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-01 05:27:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 05:27:58,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-01 05:27:58,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 05:27:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:27:58,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 05:27:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:27:59,160 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 05:27:59,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824387299] [2024-11-01 05:27:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1824387299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 05:27:59,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 05:27:59,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 05:27:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622992484] [2024-11-01 05:27:59,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 05:27:59,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 05:27:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 05:27:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 05:27:59,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-01 05:27:59,165 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 05:27:59,342 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-01 05:27:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-01 05:27:59,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-01 05:27:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 05:27:59,344 INFO L225 Difference]: With dead ends: 18 [2024-11-01 05:27:59,344 INFO L226 Difference]: Without dead ends: 16 [2024-11-01 05:27:59,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-01 05:27:59,346 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 05:27:59,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 05:27:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-01 05:27:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-01 05:27:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 05:27:59,356 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-01 05:27:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 05:27:59,356 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 05:27:59,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:27:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 05:27:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 05:27:59,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 05:27:59,359 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 05:27:59,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-01 05:27:59,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:27:59,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 05:27:59,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 05:27:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-01 05:27:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 05:27:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811833572] [2024-11-01 05:27:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 05:27:59,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:27:59,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 05:27:59,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-01 05:27:59,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-01 05:27:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 05:27:59,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-01 05:27:59,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 05:28:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:28:00,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 05:28:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:28:01,457 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 05:28:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811833572] [2024-11-01 05:28:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [811833572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 05:28:01,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 05:28:01,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2024-11-01 05:28:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724355450] [2024-11-01 05:28:01,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 05:28:01,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-01 05:28:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 05:28:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-01 05:28:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-01 05:28:01,460 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:28:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 05:28:02,286 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-01 05:28:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-01 05:28:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-01 05:28:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 05:28:02,288 INFO L225 Difference]: With dead ends: 30 [2024-11-01 05:28:02,289 INFO L226 Difference]: Without dead ends: 28 [2024-11-01 05:28:02,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2024-11-01 05:28:02,290 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-01 05:28:02,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-01 05:28:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-01 05:28:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-01 05:28:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:28:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-01 05:28:02,297 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-01 05:28:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 05:28:02,297 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-01 05:28:02,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:28:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-01 05:28:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-01 05:28:02,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 05:28:02,299 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-01 05:28:02,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-01 05:28:02,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:28:02,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 05:28:02,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 05:28:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-01 05:28:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 05:28:02,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597040560] [2024-11-01 05:28:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 05:28:02,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:28:02,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 05:28:02,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-01 05:28:02,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-01 05:28:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 05:28:02,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-01 05:28:02,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 05:28:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:28:03,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 05:28:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 05:28:13,554 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 05:28:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597040560] [2024-11-01 05:28:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [597040560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 05:28:13,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 05:28:13,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2024-11-01 05:28:13,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659439750] [2024-11-01 05:28:13,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 05:28:13,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-01 05:28:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 05:28:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-01 05:28:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2024-11-01 05:28:13,561 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:28:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 05:28:18,970 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-01 05:28:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-01 05:28:18,970 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-01 05:28:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 05:28:18,971 INFO L225 Difference]: With dead ends: 54 [2024-11-01 05:28:18,971 INFO L226 Difference]: Without dead ends: 52 [2024-11-01 05:28:18,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=728, Invalid=1342, Unknown=0, NotChecked=0, Total=2070 [2024-11-01 05:28:18,973 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-01 05:28:18,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-01 05:28:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-01 05:28:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-01 05:28:18,986 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-01 05:28:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-01 05:28:18,987 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-11-01 05:28:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 05:28:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-01 05:28:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 05:28:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-01 05:28:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-01 05:28:18,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 05:28:18,988 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-01 05:28:19,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-01 05:28:19,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:28:19,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 05:28:19,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 05:28:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 4 times [2024-11-01 05:28:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 05:28:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605169340] [2024-11-01 05:28:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 05:28:19,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:28:19,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 05:28:19,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-01 05:28:19,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-01 05:28:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 05:28:19,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 05:28:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 05:28:19,476 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 05:28:19,476 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 05:28:19,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 05:28:19,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-01 05:28:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 05:28:19,684 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-01 05:28:19,731 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 05:28:19,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 05:28:19 BoogieIcfgContainer [2024-11-01 05:28:19,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 05:28:19,735 INFO L158 Benchmark]: Toolchain (without parser) took 22858.80ms. Allocated memory was 179.3MB in the beginning and 639.6MB in the end (delta: 460.3MB). Free memory was 136.9MB in the beginning and 501.5MB in the end (delta: -364.6MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. [2024-11-01 05:28:19,736 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 05:28:19,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.39ms. Allocated memory is still 179.3MB. Free memory was 136.9MB in the beginning and 123.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 05:28:19,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.86ms. Allocated memory is still 179.3MB. Free memory was 123.3MB in the beginning and 121.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-01 05:28:19,736 INFO L158 Benchmark]: Boogie Preprocessor took 38.41ms. Allocated memory is still 179.3MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 05:28:19,737 INFO L158 Benchmark]: RCFGBuilder took 320.11ms. Allocated memory is still 179.3MB. Free memory was 119.6MB in the beginning and 107.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-01 05:28:19,737 INFO L158 Benchmark]: TraceAbstraction took 22193.87ms. Allocated memory was 179.3MB in the beginning and 639.6MB in the end (delta: 460.3MB). Free memory was 106.5MB in the beginning and 501.5MB in the end (delta: -395.0MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2024-11-01 05:28:19,738 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.14ms. Allocated memory is still 179.3MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.39ms. Allocated memory is still 179.3MB. Free memory was 136.9MB in the beginning and 123.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.86ms. Allocated memory is still 179.3MB. Free memory was 123.3MB in the beginning and 121.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.41ms. Allocated memory is still 179.3MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.11ms. Allocated memory is still 179.3MB. Free memory was 119.6MB in the beginning and 107.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22193.87ms. Allocated memory was 179.3MB in the beginning and 639.6MB in the end (delta: 460.3MB). Free memory was 106.5MB in the beginning and 501.5MB in the end (delta: -395.0MB). Peak memory consumption was 66.3MB. 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: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L31] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L33] const SORT_4 var_5 = 0; [L34] const SORT_4 var_8 = 1; [L35] const SORT_4 var_13 = mask_SORT_4; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_13=15, var_5=0, var_8=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 16 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 10.3s 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 25992 SizeOfPredicates, 41 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-01 05:28:19,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...