/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 15:08:14,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 15:08:14,566 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 15:08:14,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 15:08:14,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 15:08:14,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 15:08:14,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 15:08:14,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 15:08:14,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 15:08:14,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 15:08:14,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 15:08:14,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 15:08:14,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 15:08:14,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 15:08:14,603 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 15:08:14,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 15:08:14,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 15:08:14,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 15:08:14,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 15:08:14,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 15:08:14,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 15:08:14,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 15:08:14,609 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 15:08:14,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 15:08:14,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 15:08:14,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 15:08:14,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 15:08:14,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 15:08:14,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 15:08:14,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 15:08:14,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 15:08:14,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 15:08:14,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 15:08:14,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 15:08:14,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 15:08:14,612 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 15:08:14,614 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 15:08:14,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 15:08:14,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 15:08:14,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 15:08:14,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 15:08:14,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-05 15:08:14,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 15:08:14,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 15:08:14,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 15:08:14,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 15:08:14,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 15:08:14,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2024-11-05 15:08:16,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 15:08:16,454 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 15:08:16,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2024-11-05 15:08:16,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15d2df45/9f0ae1f97be544cc8773db525a3ad5b5/FLAG0ca401f1e [2024-11-05 15:08:16,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15d2df45/9f0ae1f97be544cc8773db525a3ad5b5 [2024-11-05 15:08:16,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 15:08:16,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 15:08:16,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 15:08:16,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 15:08:16,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 15:08:16,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 03:08:16" (1/1) ... [2024-11-05 15:08:16,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147b9868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:16, skipping insertion in model container [2024-11-05 15:08:16,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 03:08:16" (1/1) ... [2024-11-05 15:08:16,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 15:08:17,060 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.eq_sdp_v7.c[1249,1262] [2024-11-05 15:08:17,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 15:08:17,148 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 15:08:17,159 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.eq_sdp_v7.c[1249,1262] [2024-11-05 15:08:17,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 15:08:17,222 INFO L204 MainTranslator]: Completed translation [2024-11-05 15:08:17,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17 WrapperNode [2024-11-05 15:08:17,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 15:08:17,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 15:08:17,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 15:08:17,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 15:08:17,230 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:08:17" (1/1) ... [2024-11-05 15:08:17,249 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:08:17" (1/1) ... [2024-11-05 15:08:17,285 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 359 [2024-11-05 15:08:17,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 15:08:17,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 15:08:17,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 15:08:17,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 15:08:17,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,319 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 15:08:17,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 15:08:17,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 15:08:17,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 15:08:17,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 15:08:17,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (1/1) ... [2024-11-05 15:08:17,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 15:08:17,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 15:08:17,382 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 15:08:17,390 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 15:08:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 15:08:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 15:08:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 15:08:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 15:08:17,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 15:08:17,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 15:08:17,997 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-11-05 15:08:17,998 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 15:08:18,010 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 15:08:18,010 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 15:08:18,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 03:08:18 BoogieIcfgContainer [2024-11-05 15:08:18,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 15:08:18,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 15:08:18,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 15:08:18,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 15:08:18,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 03:08:16" (1/3) ... [2024-11-05 15:08:18,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a45886c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 03:08:18, skipping insertion in model container [2024-11-05 15:08:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:08:17" (2/3) ... [2024-11-05 15:08:18,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a45886c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 03:08:18, skipping insertion in model container [2024-11-05 15:08:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 03:08:18" (3/3) ... [2024-11-05 15:08:18,019 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v7.c [2024-11-05 15:08:18,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 15:08:18,037 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 15:08:18,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 15:08:18,108 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;@66c4d093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 15:08:18,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 15:08:18,112 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 15:08:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 15:08:18,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 15:08:18,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 15:08:18,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 15:08:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 15:08:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 15:08:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 15:08:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1163308525] [2024-11-05 15:08:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 15:08:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 15:08:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:18,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 15:08:18,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-05 15:08:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 15:08:18,290 WARN L253 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-05 15:08:18,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 15:08:18,789 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 15:08:18,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 15:08:19,330 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 15:08:19,331 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 15:08:19,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1163308525] [2024-11-05 15:08:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1163308525] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 15:08:19,332 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 15:08:19,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 15:08:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108589514] [2024-11-05 15:08:19,335 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 15:08:19,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 15:08:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 15:08:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 15:08:19,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 15:08:19,366 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 15:08:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 15:08:19,415 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-05 15:08:19,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 15:08:19,418 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 15:08:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 15:08:19,424 INFO L225 Difference]: With dead ends: 17 [2024-11-05 15:08:19,424 INFO L226 Difference]: Without dead ends: 9 [2024-11-05 15:08:19,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 15:08:19,430 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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 15:08:19,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 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 15:08:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-05 15:08:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-05 15:08:19,454 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 15:08:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 15:08:19,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 15:08:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 15:08:19,457 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 15:08:19,457 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 15:08:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 15:08:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 15:08:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 15:08:19,458 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 15:08:19,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-05 15:08:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:19,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 15:08:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 15:08:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 15:08:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 15:08:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810731353] [2024-11-05 15:08:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 15:08:19,662 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 15:08:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:19,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 15:08:19,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-05 15:08:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 15:08:19,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-05 15:08:19,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 15:08:20,443 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 15:08:20,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 15:08:23,408 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 15:08:23,409 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 15:08:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810731353] [2024-11-05 15:08:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [810731353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 15:08:23,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 15:08:23,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 15:08:23,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751456444] [2024-11-05 15:08:23,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 15:08:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 15:08:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 15:08:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 15:08:23,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-05 15:08:23,413 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-05 15:08:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 15:08:23,620 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-05 15:08:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 15:08:23,621 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-05 15:08:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 15:08:23,621 INFO L225 Difference]: With dead ends: 14 [2024-11-05 15:08:23,621 INFO L226 Difference]: Without dead ends: 12 [2024-11-05 15:08:23,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-05 15:08:23,623 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 15:08:23,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 15:08:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-05 15:08:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-05 15:08:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 15:08:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-05 15:08:23,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-05 15:08:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 15:08:23,632 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-05 15:08:23,632 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-05 15:08:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-05 15:08:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 15:08:23,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 15:08:23,633 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-05 15:08:23,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-05 15:08:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:23,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 15:08:23,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 15:08:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-05 15:08:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 15:08:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356041124] [2024-11-05 15:08:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 15:08:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 15:08:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:23,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 15:08:23,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-05 15:08:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 15:08:24,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-05 15:08:24,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 15:08:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 15:08:24,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 15:08:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 15:08:34,271 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 15:08:34,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356041124] [2024-11-05 15:08:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [356041124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 15:08:34,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 15:08:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-05 15:08:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702354154] [2024-11-05 15:08:34,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 15:08:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 15:08:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 15:08:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 15:08:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-05 15:08:34,274 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 15:08:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 15:08:34,678 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-05 15:08:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 15:08:34,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-05 15:08:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 15:08:34,679 INFO L225 Difference]: With dead ends: 17 [2024-11-05 15:08:34,680 INFO L226 Difference]: Without dead ends: 15 [2024-11-05 15:08:34,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-11-05 15:08:34,681 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 15:08:34,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 15:08:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-05 15:08:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-05 15:08:34,685 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 15:08:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-05 15:08:34,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-05 15:08:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 15:08:34,686 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-05 15:08:34,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 15:08:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-05 15:08:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 15:08:34,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 15:08:34,687 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-05 15:08:34,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-05 15:08:34,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:34,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 15:08:34,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 15:08:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-05 15:08:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 15:08:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426402244] [2024-11-05 15:08:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 15:08:34,889 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 15:08:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:34,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 15:08:34,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-05 15:08:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 15:08:35,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 15:08:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 15:08:35,304 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 15:08:35,304 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 15:08:35,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 15:08:35,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Ended with exit code 0 [2024-11-05 15:08:35,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 15:08:35,514 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-05 15:08:35,575 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 15:08:35,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 03:08:35 BoogieIcfgContainer [2024-11-05 15:08:35,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 15:08:35,580 INFO L158 Benchmark]: Toolchain (without parser) took 18732.07ms. Allocated memory was 194.0MB in the beginning and 650.1MB in the end (delta: 456.1MB). Free memory was 148.9MB in the beginning and 402.6MB in the end (delta: -253.7MB). Peak memory consumption was 203.2MB. Max. memory is 8.0GB. [2024-11-05 15:08:35,581 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 15:08:35,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.15ms. Allocated memory is still 194.0MB. Free memory was 148.6MB in the beginning and 129.0MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-11-05 15:08:35,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.66ms. Allocated memory is still 194.0MB. Free memory was 129.0MB in the beginning and 125.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 15:08:35,582 INFO L158 Benchmark]: Boogie Preprocessor took 57.21ms. Allocated memory is still 194.0MB. Free memory was 125.6MB in the beginning and 121.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-05 15:08:35,582 INFO L158 Benchmark]: RCFGBuilder took 666.30ms. Allocated memory was 194.0MB in the beginning and 256.9MB in the end (delta: 62.9MB). Free memory was 121.6MB in the beginning and 202.4MB in the end (delta: -80.8MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2024-11-05 15:08:35,582 INFO L158 Benchmark]: TraceAbstraction took 17566.42ms. Allocated memory was 256.9MB in the beginning and 650.1MB in the end (delta: 393.2MB). Free memory was 201.9MB in the beginning and 402.6MB in the end (delta: -200.7MB). Peak memory consumption was 193.0MB. Max. memory is 8.0GB. [2024-11-05 15:08:35,586 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.15ms. Allocated memory is still 194.0MB. Free memory was 148.6MB in the beginning and 129.0MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.66ms. Allocated memory is still 194.0MB. Free memory was 129.0MB in the beginning and 125.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.21ms. Allocated memory is still 194.0MB. Free memory was 125.6MB in the beginning and 121.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 666.30ms. Allocated memory was 194.0MB in the beginning and 256.9MB in the end (delta: 62.9MB). Free memory was 121.6MB in the beginning and 202.4MB in the end (delta: -80.8MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 17566.42ms. Allocated memory was 256.9MB in the beginning and 650.1MB in the end (delta: 393.2MB). Free memory was 201.9MB in the beginning and 402.6MB in the end (delta: -200.7MB). Peak memory consumption was 193.0MB. 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 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_22 = 0; [L34] const SORT_5 var_31 = 1; [L35] const SORT_1 var_109 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_35; [L44] SORT_5 input_37; [L45] SORT_5 input_39; [L46] SORT_5 input_51; [L48] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] SORT_5 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L54] SORT_5 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] SORT_5 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L59] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] SORT_5 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_11_arg_1 = var_9; [L70] state_10 = init_11_arg_1 [L71] SORT_1 init_13_arg_1 = var_9; [L72] state_12 = init_13_arg_1 [L73] SORT_1 init_19_arg_1 = var_9; [L74] state_18 = init_19_arg_1 [L75] SORT_5 init_24_arg_1 = var_22; [L76] state_23 = init_24_arg_1 [L77] SORT_1 init_27_arg_1 = var_9; [L78] state_26 = init_27_arg_1 [L79] SORT_5 init_42_arg_1 = var_22; [L80] state_41 = init_42_arg_1 [L81] SORT_5 init_44_arg_1 = var_22; [L82] state_43 = init_44_arg_1 [L83] SORT_1 init_46_arg_1 = var_9; [L84] state_45 = init_46_arg_1 [L85] SORT_1 init_48_arg_1 = var_9; [L86] state_47 = init_48_arg_1 [L87] SORT_1 init_50_arg_1 = var_9; [L88] state_49 = init_50_arg_1 [L89] SORT_5 init_54_arg_1 = var_22; [L90] state_53 = init_54_arg_1 [L91] SORT_1 init_56_arg_1 = var_9; [L92] state_55 = init_56_arg_1 [L93] SORT_5 init_58_arg_1 = var_22; [L94] state_57 = init_58_arg_1 [L95] SORT_1 init_60_arg_1 = var_9; [L96] state_59 = init_60_arg_1 [L97] SORT_1 init_63_arg_1 = var_9; [L98] state_62 = init_63_arg_1 [L99] SORT_1 init_65_arg_1 = var_9; [L100] state_64 = init_65_arg_1 [L101] SORT_1 init_67_arg_1 = var_9; [L102] state_66 = init_67_arg_1 [L103] SORT_1 init_69_arg_1 = var_9; [L104] state_68 = init_69_arg_1 [L105] SORT_1 init_71_arg_1 = var_9; [L106] state_70 = init_71_arg_1 [L107] SORT_1 init_73_arg_1 = var_9; [L108] state_72 = init_73_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND FALSE !(!(cond)) [L158] RET __VERIFIER_assert(!(bad_34_arg_0)) [L160] SORT_5 var_76_arg_0 = input_8; [L161] SORT_5 var_76_arg_1 = var_31; [L162] SORT_5 var_76 = var_76_arg_0 == var_76_arg_1; [L163] SORT_5 var_77_arg_0 = var_76; [L164] SORT_1 var_77_arg_1 = var_9; [L165] SORT_1 var_77_arg_2 = state_64; [L166] SORT_1 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L167] SORT_1 next_78_arg_1 = var_77; [L168] SORT_5 var_79_arg_0 = var_76; [L169] SORT_1 var_79_arg_1 = var_9; [L170] SORT_1 var_79_arg_2 = state_68; [L171] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L172] SORT_1 next_80_arg_1 = var_79; [L173] SORT_5 var_81_arg_0 = var_76; [L174] SORT_1 var_81_arg_1 = var_9; [L175] SORT_1 var_81_arg_2 = state_72; [L176] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L177] SORT_1 next_82_arg_1 = var_81; [L178] SORT_5 var_83_arg_0 = var_76; [L179] SORT_5 var_83_arg_1 = var_22; [L180] SORT_5 var_83_arg_2 = state_43; [L181] SORT_5 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L182] var_83 = var_83 & mask_SORT_5 [L183] SORT_5 next_84_arg_1 = var_83; [L184] SORT_5 var_88_arg_0 = input_8; [L185] SORT_5 var_88_arg_1 = var_31; [L186] SORT_5 var_88 = var_88_arg_0 == var_88_arg_1; [L187] SORT_1 var_86_arg_0 = state_59; [L188] SORT_1 var_86_arg_1 = state_55; [L189] SORT_1 var_86 = var_86_arg_0 - var_86_arg_1; [L190] SORT_1 var_85_arg_0 = state_59; [L191] SORT_1 var_85_arg_1 = state_55; [L192] SORT_1 var_85 = var_85_arg_0 - var_85_arg_1; [L193] SORT_5 var_87_arg_0 = state_57; [L194] SORT_1 var_87_arg_1 = var_86; [L195] SORT_1 var_87_arg_2 = var_85; [L196] SORT_1 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L197] SORT_5 var_89_arg_0 = var_88; [L198] SORT_1 var_89_arg_1 = var_9; [L199] SORT_1 var_89_arg_2 = var_87; [L200] SORT_1 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L201] var_89 = var_89 & mask_SORT_1 [L202] SORT_1 next_90_arg_1 = var_89; [L203] SORT_5 var_91_arg_0 = var_76; [L204] SORT_5 var_91_arg_1 = var_22; [L205] SORT_5 var_91_arg_2 = input_7; [L206] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L207] SORT_5 next_92_arg_1 = var_91; [L208] SORT_5 var_93_arg_0 = var_76; [L209] SORT_5 var_93_arg_1 = var_22; [L210] SORT_5 var_93_arg_2 = state_41; [L211] SORT_5 var_93 = var_93_arg_0 ? var_93_arg_1 : var_93_arg_2; [L212] SORT_5 next_94_arg_1 = var_93; [L213] SORT_5 var_95_arg_0 = var_88; [L214] SORT_1 var_95_arg_1 = var_9; [L215] SORT_1 var_95_arg_2 = input_2; [L216] SORT_1 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L217] SORT_1 next_96_arg_1 = var_95; [L218] SORT_5 var_97_arg_0 = var_88; [L219] SORT_1 var_97_arg_1 = var_9; [L220] SORT_1 var_97_arg_2 = input_3; [L221] SORT_1 var_97 = var_97_arg_0 ? var_97_arg_1 : var_97_arg_2; [L222] SORT_1 next_98_arg_1 = var_97; [L223] SORT_5 var_99_arg_0 = var_88; [L224] SORT_1 var_99_arg_1 = var_9; [L225] SORT_1 var_99_arg_2 = input_4; [L226] SORT_1 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L227] SORT_1 next_100_arg_1 = var_99; [L228] SORT_5 var_101_arg_0 = var_88; [L229] SORT_5 var_101_arg_1 = var_22; [L230] SORT_5 var_101_arg_2 = input_7; [L231] SORT_5 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L232] SORT_5 next_102_arg_1 = var_101; [L233] SORT_5 var_103_arg_0 = var_88; [L234] SORT_1 var_103_arg_1 = var_9; [L235] SORT_1 var_103_arg_2 = state_49; [L236] SORT_1 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L237] SORT_1 next_104_arg_1 = var_103; [L238] SORT_5 var_105_arg_0 = var_88; [L239] SORT_5 var_105_arg_1 = var_22; [L240] SORT_5 var_105_arg_2 = state_53; [L241] SORT_5 var_105 = var_105_arg_0 ? var_105_arg_1 : var_105_arg_2; [L242] var_105 = var_105 & mask_SORT_5 [L243] SORT_5 next_106_arg_1 = var_105; [L244] SORT_1 var_110_arg_0 = state_45; [L245] SORT_1 var_110_arg_1 = var_109; [L246] SORT_1 var_110 = var_110_arg_0 & var_110_arg_1; [L247] var_110 = var_110 & mask_SORT_1 [L248] SORT_1 var_111_arg_0 = var_110; [L249] SORT_1 var_111_arg_1 = var_109; [L250] SORT_5 var_111 = var_111_arg_0 == var_111_arg_1; [L251] SORT_1 var_108_arg_0 = state_45; [L252] SORT_1 var_108_arg_1 = state_47; [L253] SORT_1 var_108 = var_108_arg_0 + var_108_arg_1; [L254] SORT_1 var_107_arg_0 = state_45; [L255] SORT_1 var_107_arg_1 = state_47; [L256] SORT_1 var_107 = var_107_arg_0 - var_107_arg_1; [L257] SORT_5 var_112_arg_0 = var_111; [L258] SORT_1 var_112_arg_1 = var_108; [L259] SORT_1 var_112_arg_2 = var_107; [L260] SORT_1 var_112 = var_112_arg_0 ? var_112_arg_1 : var_112_arg_2; [L261] SORT_5 var_113_arg_0 = var_88; [L262] SORT_1 var_113_arg_1 = var_9; [L263] SORT_1 var_113_arg_2 = var_112; [L264] SORT_1 var_113 = var_113_arg_0 ? var_113_arg_1 : var_113_arg_2; [L265] SORT_1 next_114_arg_1 = var_113; [L266] SORT_5 var_115_arg_0 = var_76; [L267] SORT_1 var_115_arg_1 = var_9; [L268] SORT_1 var_115_arg_2 = input_2; [L269] SORT_1 var_115 = var_115_arg_0 ? var_115_arg_1 : var_115_arg_2; [L270] SORT_1 next_116_arg_1 = var_115; [L271] SORT_5 var_117_arg_0 = var_76; [L272] SORT_1 var_117_arg_1 = var_9; [L273] SORT_1 var_117_arg_2 = state_62; [L274] SORT_1 var_117 = var_117_arg_0 ? var_117_arg_1 : var_117_arg_2; [L275] SORT_1 next_118_arg_1 = var_117; [L276] SORT_5 var_119_arg_0 = var_76; [L277] SORT_1 var_119_arg_1 = var_9; [L278] SORT_1 var_119_arg_2 = input_3; [L279] SORT_1 var_119 = var_119_arg_0 ? var_119_arg_1 : var_119_arg_2; [L280] SORT_1 next_120_arg_1 = var_119; [L281] SORT_5 var_121_arg_0 = var_76; [L282] SORT_1 var_121_arg_1 = var_9; [L283] SORT_1 var_121_arg_2 = state_66; [L284] SORT_1 var_121 = var_121_arg_0 ? var_121_arg_1 : var_121_arg_2; [L285] SORT_1 next_122_arg_1 = var_121; [L286] SORT_5 var_123_arg_0 = var_76; [L287] SORT_1 var_123_arg_1 = var_9; [L288] SORT_1 var_123_arg_2 = input_4; [L289] SORT_1 var_123 = var_123_arg_0 ? var_123_arg_1 : var_123_arg_2; [L290] SORT_1 next_124_arg_1 = var_123; [L291] SORT_5 var_125_arg_0 = var_76; [L292] SORT_1 var_125_arg_1 = var_9; [L293] SORT_1 var_125_arg_2 = state_70; [L294] SORT_1 var_125 = var_125_arg_0 ? var_125_arg_1 : var_125_arg_2; [L295] SORT_1 next_126_arg_1 = var_125; [L297] state_10 = next_78_arg_1 [L298] state_12 = next_80_arg_1 [L299] state_18 = next_82_arg_1 [L300] state_23 = next_84_arg_1 [L301] state_26 = next_90_arg_1 [L302] state_41 = next_92_arg_1 [L303] state_43 = next_94_arg_1 [L304] state_45 = next_96_arg_1 [L305] state_47 = next_98_arg_1 [L306] state_49 = next_100_arg_1 [L307] state_53 = next_102_arg_1 [L308] state_55 = next_104_arg_1 [L309] state_57 = next_106_arg_1 [L310] state_59 = next_114_arg_1 [L311] state_62 = next_116_arg_1 [L312] state_64 = next_118_arg_1 [L313] state_66 = next_120_arg_1 [L314] state_68 = next_122_arg_1 [L315] state_70 = next_124_arg_1 [L316] state_72 = next_126_arg_1 [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND FALSE !(!(cond)) [L158] RET __VERIFIER_assert(!(bad_34_arg_0)) [L160] SORT_5 var_76_arg_0 = input_8; [L161] SORT_5 var_76_arg_1 = var_31; [L162] SORT_5 var_76 = var_76_arg_0 == var_76_arg_1; [L163] SORT_5 var_77_arg_0 = var_76; [L164] SORT_1 var_77_arg_1 = var_9; [L165] SORT_1 var_77_arg_2 = state_64; [L166] SORT_1 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L167] SORT_1 next_78_arg_1 = var_77; [L168] SORT_5 var_79_arg_0 = var_76; [L169] SORT_1 var_79_arg_1 = var_9; [L170] SORT_1 var_79_arg_2 = state_68; [L171] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L172] SORT_1 next_80_arg_1 = var_79; [L173] SORT_5 var_81_arg_0 = var_76; [L174] SORT_1 var_81_arg_1 = var_9; [L175] SORT_1 var_81_arg_2 = state_72; [L176] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L177] SORT_1 next_82_arg_1 = var_81; [L178] SORT_5 var_83_arg_0 = var_76; [L179] SORT_5 var_83_arg_1 = var_22; [L180] SORT_5 var_83_arg_2 = state_43; [L181] SORT_5 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L182] var_83 = var_83 & mask_SORT_5 [L183] SORT_5 next_84_arg_1 = var_83; [L184] SORT_5 var_88_arg_0 = input_8; [L185] SORT_5 var_88_arg_1 = var_31; [L186] SORT_5 var_88 = var_88_arg_0 == var_88_arg_1; [L187] SORT_1 var_86_arg_0 = state_59; [L188] SORT_1 var_86_arg_1 = state_55; [L189] SORT_1 var_86 = var_86_arg_0 - var_86_arg_1; [L190] SORT_1 var_85_arg_0 = state_59; [L191] SORT_1 var_85_arg_1 = state_55; [L192] SORT_1 var_85 = var_85_arg_0 - var_85_arg_1; [L193] SORT_5 var_87_arg_0 = state_57; [L194] SORT_1 var_87_arg_1 = var_86; [L195] SORT_1 var_87_arg_2 = var_85; [L196] SORT_1 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L197] SORT_5 var_89_arg_0 = var_88; [L198] SORT_1 var_89_arg_1 = var_9; [L199] SORT_1 var_89_arg_2 = var_87; [L200] SORT_1 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L201] var_89 = var_89 & mask_SORT_1 [L202] SORT_1 next_90_arg_1 = var_89; [L203] SORT_5 var_91_arg_0 = var_76; [L204] SORT_5 var_91_arg_1 = var_22; [L205] SORT_5 var_91_arg_2 = input_7; [L206] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L207] SORT_5 next_92_arg_1 = var_91; [L208] SORT_5 var_93_arg_0 = var_76; [L209] SORT_5 var_93_arg_1 = var_22; [L210] SORT_5 var_93_arg_2 = state_41; [L211] SORT_5 var_93 = var_93_arg_0 ? var_93_arg_1 : var_93_arg_2; [L212] SORT_5 next_94_arg_1 = var_93; [L213] SORT_5 var_95_arg_0 = var_88; [L214] SORT_1 var_95_arg_1 = var_9; [L215] SORT_1 var_95_arg_2 = input_2; [L216] SORT_1 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L217] SORT_1 next_96_arg_1 = var_95; [L218] SORT_5 var_97_arg_0 = var_88; [L219] SORT_1 var_97_arg_1 = var_9; [L220] SORT_1 var_97_arg_2 = input_3; [L221] SORT_1 var_97 = var_97_arg_0 ? var_97_arg_1 : var_97_arg_2; [L222] SORT_1 next_98_arg_1 = var_97; [L223] SORT_5 var_99_arg_0 = var_88; [L224] SORT_1 var_99_arg_1 = var_9; [L225] SORT_1 var_99_arg_2 = input_4; [L226] SORT_1 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L227] SORT_1 next_100_arg_1 = var_99; [L228] SORT_5 var_101_arg_0 = var_88; [L229] SORT_5 var_101_arg_1 = var_22; [L230] SORT_5 var_101_arg_2 = input_7; [L231] SORT_5 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L232] SORT_5 next_102_arg_1 = var_101; [L233] SORT_5 var_103_arg_0 = var_88; [L234] SORT_1 var_103_arg_1 = var_9; [L235] SORT_1 var_103_arg_2 = state_49; [L236] SORT_1 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L237] SORT_1 next_104_arg_1 = var_103; [L238] SORT_5 var_105_arg_0 = var_88; [L239] SORT_5 var_105_arg_1 = var_22; [L240] SORT_5 var_105_arg_2 = state_53; [L241] SORT_5 var_105 = var_105_arg_0 ? var_105_arg_1 : var_105_arg_2; [L242] var_105 = var_105 & mask_SORT_5 [L243] SORT_5 next_106_arg_1 = var_105; [L244] SORT_1 var_110_arg_0 = state_45; [L245] SORT_1 var_110_arg_1 = var_109; [L246] SORT_1 var_110 = var_110_arg_0 & var_110_arg_1; [L247] var_110 = var_110 & mask_SORT_1 [L248] SORT_1 var_111_arg_0 = var_110; [L249] SORT_1 var_111_arg_1 = var_109; [L250] SORT_5 var_111 = var_111_arg_0 == var_111_arg_1; [L251] SORT_1 var_108_arg_0 = state_45; [L252] SORT_1 var_108_arg_1 = state_47; [L253] SORT_1 var_108 = var_108_arg_0 + var_108_arg_1; [L254] SORT_1 var_107_arg_0 = state_45; [L255] SORT_1 var_107_arg_1 = state_47; [L256] SORT_1 var_107 = var_107_arg_0 - var_107_arg_1; [L257] SORT_5 var_112_arg_0 = var_111; [L258] SORT_1 var_112_arg_1 = var_108; [L259] SORT_1 var_112_arg_2 = var_107; [L260] SORT_1 var_112 = var_112_arg_0 ? var_112_arg_1 : var_112_arg_2; [L261] SORT_5 var_113_arg_0 = var_88; [L262] SORT_1 var_113_arg_1 = var_9; [L263] SORT_1 var_113_arg_2 = var_112; [L264] SORT_1 var_113 = var_113_arg_0 ? var_113_arg_1 : var_113_arg_2; [L265] SORT_1 next_114_arg_1 = var_113; [L266] SORT_5 var_115_arg_0 = var_76; [L267] SORT_1 var_115_arg_1 = var_9; [L268] SORT_1 var_115_arg_2 = input_2; [L269] SORT_1 var_115 = var_115_arg_0 ? var_115_arg_1 : var_115_arg_2; [L270] SORT_1 next_116_arg_1 = var_115; [L271] SORT_5 var_117_arg_0 = var_76; [L272] SORT_1 var_117_arg_1 = var_9; [L273] SORT_1 var_117_arg_2 = state_62; [L274] SORT_1 var_117 = var_117_arg_0 ? var_117_arg_1 : var_117_arg_2; [L275] SORT_1 next_118_arg_1 = var_117; [L276] SORT_5 var_119_arg_0 = var_76; [L277] SORT_1 var_119_arg_1 = var_9; [L278] SORT_1 var_119_arg_2 = input_3; [L279] SORT_1 var_119 = var_119_arg_0 ? var_119_arg_1 : var_119_arg_2; [L280] SORT_1 next_120_arg_1 = var_119; [L281] SORT_5 var_121_arg_0 = var_76; [L282] SORT_1 var_121_arg_1 = var_9; [L283] SORT_1 var_121_arg_2 = state_66; [L284] SORT_1 var_121 = var_121_arg_0 ? var_121_arg_1 : var_121_arg_2; [L285] SORT_1 next_122_arg_1 = var_121; [L286] SORT_5 var_123_arg_0 = var_76; [L287] SORT_1 var_123_arg_1 = var_9; [L288] SORT_1 var_123_arg_2 = input_4; [L289] SORT_1 var_123 = var_123_arg_0 ? var_123_arg_1 : var_123_arg_2; [L290] SORT_1 next_124_arg_1 = var_123; [L291] SORT_5 var_125_arg_0 = var_76; [L292] SORT_1 var_125_arg_1 = var_9; [L293] SORT_1 var_125_arg_2 = state_70; [L294] SORT_1 var_125 = var_125_arg_0 ? var_125_arg_1 : var_125_arg_2; [L295] SORT_1 next_126_arg_1 = var_125; [L297] state_10 = next_78_arg_1 [L298] state_12 = next_80_arg_1 [L299] state_18 = next_82_arg_1 [L300] state_23 = next_84_arg_1 [L301] state_26 = next_90_arg_1 [L302] state_41 = next_92_arg_1 [L303] state_43 = next_94_arg_1 [L304] state_45 = next_96_arg_1 [L305] state_47 = next_98_arg_1 [L306] state_49 = next_100_arg_1 [L307] state_53 = next_102_arg_1 [L308] state_55 = next_104_arg_1 [L309] state_57 = next_106_arg_1 [L310] state_59 = next_114_arg_1 [L311] state_62 = next_116_arg_1 [L312] state_64 = next_118_arg_1 [L313] state_66 = next_120_arg_1 [L314] state_68 = next_122_arg_1 [L315] state_70 = next_124_arg_1 [L316] state_72 = next_126_arg_1 [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND FALSE !(!(cond)) [L158] RET __VERIFIER_assert(!(bad_34_arg_0)) [L160] SORT_5 var_76_arg_0 = input_8; [L161] SORT_5 var_76_arg_1 = var_31; [L162] SORT_5 var_76 = var_76_arg_0 == var_76_arg_1; [L163] SORT_5 var_77_arg_0 = var_76; [L164] SORT_1 var_77_arg_1 = var_9; [L165] SORT_1 var_77_arg_2 = state_64; [L166] SORT_1 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L167] SORT_1 next_78_arg_1 = var_77; [L168] SORT_5 var_79_arg_0 = var_76; [L169] SORT_1 var_79_arg_1 = var_9; [L170] SORT_1 var_79_arg_2 = state_68; [L171] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L172] SORT_1 next_80_arg_1 = var_79; [L173] SORT_5 var_81_arg_0 = var_76; [L174] SORT_1 var_81_arg_1 = var_9; [L175] SORT_1 var_81_arg_2 = state_72; [L176] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L177] SORT_1 next_82_arg_1 = var_81; [L178] SORT_5 var_83_arg_0 = var_76; [L179] SORT_5 var_83_arg_1 = var_22; [L180] SORT_5 var_83_arg_2 = state_43; [L181] SORT_5 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L182] var_83 = var_83 & mask_SORT_5 [L183] SORT_5 next_84_arg_1 = var_83; [L184] SORT_5 var_88_arg_0 = input_8; [L185] SORT_5 var_88_arg_1 = var_31; [L186] SORT_5 var_88 = var_88_arg_0 == var_88_arg_1; [L187] SORT_1 var_86_arg_0 = state_59; [L188] SORT_1 var_86_arg_1 = state_55; [L189] SORT_1 var_86 = var_86_arg_0 - var_86_arg_1; [L190] SORT_1 var_85_arg_0 = state_59; [L191] SORT_1 var_85_arg_1 = state_55; [L192] SORT_1 var_85 = var_85_arg_0 - var_85_arg_1; [L193] SORT_5 var_87_arg_0 = state_57; [L194] SORT_1 var_87_arg_1 = var_86; [L195] SORT_1 var_87_arg_2 = var_85; [L196] SORT_1 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L197] SORT_5 var_89_arg_0 = var_88; [L198] SORT_1 var_89_arg_1 = var_9; [L199] SORT_1 var_89_arg_2 = var_87; [L200] SORT_1 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L201] var_89 = var_89 & mask_SORT_1 [L202] SORT_1 next_90_arg_1 = var_89; [L203] SORT_5 var_91_arg_0 = var_76; [L204] SORT_5 var_91_arg_1 = var_22; [L205] SORT_5 var_91_arg_2 = input_7; [L206] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L207] SORT_5 next_92_arg_1 = var_91; [L208] SORT_5 var_93_arg_0 = var_76; [L209] SORT_5 var_93_arg_1 = var_22; [L210] SORT_5 var_93_arg_2 = state_41; [L211] SORT_5 var_93 = var_93_arg_0 ? var_93_arg_1 : var_93_arg_2; [L212] SORT_5 next_94_arg_1 = var_93; [L213] SORT_5 var_95_arg_0 = var_88; [L214] SORT_1 var_95_arg_1 = var_9; [L215] SORT_1 var_95_arg_2 = input_2; [L216] SORT_1 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L217] SORT_1 next_96_arg_1 = var_95; [L218] SORT_5 var_97_arg_0 = var_88; [L219] SORT_1 var_97_arg_1 = var_9; [L220] SORT_1 var_97_arg_2 = input_3; [L221] SORT_1 var_97 = var_97_arg_0 ? var_97_arg_1 : var_97_arg_2; [L222] SORT_1 next_98_arg_1 = var_97; [L223] SORT_5 var_99_arg_0 = var_88; [L224] SORT_1 var_99_arg_1 = var_9; [L225] SORT_1 var_99_arg_2 = input_4; [L226] SORT_1 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L227] SORT_1 next_100_arg_1 = var_99; [L228] SORT_5 var_101_arg_0 = var_88; [L229] SORT_5 var_101_arg_1 = var_22; [L230] SORT_5 var_101_arg_2 = input_7; [L231] SORT_5 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L232] SORT_5 next_102_arg_1 = var_101; [L233] SORT_5 var_103_arg_0 = var_88; [L234] SORT_1 var_103_arg_1 = var_9; [L235] SORT_1 var_103_arg_2 = state_49; [L236] SORT_1 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L237] SORT_1 next_104_arg_1 = var_103; [L238] SORT_5 var_105_arg_0 = var_88; [L239] SORT_5 var_105_arg_1 = var_22; [L240] SORT_5 var_105_arg_2 = state_53; [L241] SORT_5 var_105 = var_105_arg_0 ? var_105_arg_1 : var_105_arg_2; [L242] var_105 = var_105 & mask_SORT_5 [L243] SORT_5 next_106_arg_1 = var_105; [L244] SORT_1 var_110_arg_0 = state_45; [L245] SORT_1 var_110_arg_1 = var_109; [L246] SORT_1 var_110 = var_110_arg_0 & var_110_arg_1; [L247] var_110 = var_110 & mask_SORT_1 [L248] SORT_1 var_111_arg_0 = var_110; [L249] SORT_1 var_111_arg_1 = var_109; [L250] SORT_5 var_111 = var_111_arg_0 == var_111_arg_1; [L251] SORT_1 var_108_arg_0 = state_45; [L252] SORT_1 var_108_arg_1 = state_47; [L253] SORT_1 var_108 = var_108_arg_0 + var_108_arg_1; [L254] SORT_1 var_107_arg_0 = state_45; [L255] SORT_1 var_107_arg_1 = state_47; [L256] SORT_1 var_107 = var_107_arg_0 - var_107_arg_1; [L257] SORT_5 var_112_arg_0 = var_111; [L258] SORT_1 var_112_arg_1 = var_108; [L259] SORT_1 var_112_arg_2 = var_107; [L260] SORT_1 var_112 = var_112_arg_0 ? var_112_arg_1 : var_112_arg_2; [L261] SORT_5 var_113_arg_0 = var_88; [L262] SORT_1 var_113_arg_1 = var_9; [L263] SORT_1 var_113_arg_2 = var_112; [L264] SORT_1 var_113 = var_113_arg_0 ? var_113_arg_1 : var_113_arg_2; [L265] SORT_1 next_114_arg_1 = var_113; [L266] SORT_5 var_115_arg_0 = var_76; [L267] SORT_1 var_115_arg_1 = var_9; [L268] SORT_1 var_115_arg_2 = input_2; [L269] SORT_1 var_115 = var_115_arg_0 ? var_115_arg_1 : var_115_arg_2; [L270] SORT_1 next_116_arg_1 = var_115; [L271] SORT_5 var_117_arg_0 = var_76; [L272] SORT_1 var_117_arg_1 = var_9; [L273] SORT_1 var_117_arg_2 = state_62; [L274] SORT_1 var_117 = var_117_arg_0 ? var_117_arg_1 : var_117_arg_2; [L275] SORT_1 next_118_arg_1 = var_117; [L276] SORT_5 var_119_arg_0 = var_76; [L277] SORT_1 var_119_arg_1 = var_9; [L278] SORT_1 var_119_arg_2 = input_3; [L279] SORT_1 var_119 = var_119_arg_0 ? var_119_arg_1 : var_119_arg_2; [L280] SORT_1 next_120_arg_1 = var_119; [L281] SORT_5 var_121_arg_0 = var_76; [L282] SORT_1 var_121_arg_1 = var_9; [L283] SORT_1 var_121_arg_2 = state_66; [L284] SORT_1 var_121 = var_121_arg_0 ? var_121_arg_1 : var_121_arg_2; [L285] SORT_1 next_122_arg_1 = var_121; [L286] SORT_5 var_123_arg_0 = var_76; [L287] SORT_1 var_123_arg_1 = var_9; [L288] SORT_1 var_123_arg_2 = input_4; [L289] SORT_1 var_123 = var_123_arg_0 ? var_123_arg_1 : var_123_arg_2; [L290] SORT_1 next_124_arg_1 = var_123; [L291] SORT_5 var_125_arg_0 = var_76; [L292] SORT_1 var_125_arg_1 = var_9; [L293] SORT_1 var_125_arg_2 = state_70; [L294] SORT_1 var_125 = var_125_arg_0 ? var_125_arg_1 : var_125_arg_2; [L295] SORT_1 next_126_arg_1 = var_125; [L297] state_10 = next_78_arg_1 [L298] state_12 = next_80_arg_1 [L299] state_18 = next_82_arg_1 [L300] state_23 = next_84_arg_1 [L301] state_26 = next_90_arg_1 [L302] state_41 = next_92_arg_1 [L303] state_43 = next_94_arg_1 [L304] state_45 = next_96_arg_1 [L305] state_47 = next_98_arg_1 [L306] state_49 = next_100_arg_1 [L307] state_53 = next_102_arg_1 [L308] state_55 = next_104_arg_1 [L309] state_57 = next_106_arg_1 [L310] state_59 = next_114_arg_1 [L311] state_62 = next_116_arg_1 [L312] state_64 = next_118_arg_1 [L313] state_66 = next_120_arg_1 [L314] state_68 = next_122_arg_1 [L315] state_70 = next_124_arg_1 [L316] state_72 = next_126_arg_1 [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_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: 17.4s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 13 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 11 QuantifiedInterpolants, 12306 SizeOfPredicates, 16 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/18 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 15:08:35,631 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...