/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.dyn_partition.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 04:43:21,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 04:43:22,022 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 04:43:22,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 04:43:22,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 04:43:22,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 04:43:22,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 04:43:22,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 04:43:22,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 04:43:22,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 04:43:22,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 04:43:22,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 04:43:22,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 04:43:22,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 04:43:22,053 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 04:43:22,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 04:43:22,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 04:43:22,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 04:43:22,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 04:43:22,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 04:43:22,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 04:43:22,056 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 04:43:22,056 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 04:43:22,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 04:43:22,056 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 04:43:22,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 04:43:22,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 04:43:22,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 04:43:22,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 04:43:22,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 04:43:22,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 04:43:22,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 04:43:22,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 04:43:22,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 04:43:22,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 04:43:22,058 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 04:43:22,058 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 04:43:22,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 04:43:22,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 04:43:22,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 04:43:22,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 04:43:22,059 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 04:43:22,059 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 04:43:22,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 04:43:22,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 04:43:22,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 04:43:22,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 04:43:22,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 04:43:22,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-01 04:43:23,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 04:43:23,653 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 04:43:23,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-01 04:43:23,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db31999a7/f4d941c59d1e476e8d6c940cef1b3f11/FLAG03e7bd956 [2024-11-01 04:43:24,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db31999a7/f4d941c59d1e476e8d6c940cef1b3f11 [2024-11-01 04:43:24,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 04:43:24,070 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 04:43:24,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 04:43:24,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 04:43:24,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 04:43:24,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580c609d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24, skipping insertion in model container [2024-11-01 04:43:24,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 04:43:24,221 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.dyn_partition.c[1253,1266] [2024-11-01 04:43:24,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 04:43:24,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 04:43:24,289 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.dyn_partition.c[1253,1266] [2024-11-01 04:43:24,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 04:43:24,326 INFO L204 MainTranslator]: Completed translation [2024-11-01 04:43:24,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24 WrapperNode [2024-11-01 04:43:24,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 04:43:24,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 04:43:24,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 04:43:24,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 04:43:24,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,370 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-01 04:43:24,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 04:43:24,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 04:43:24,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 04:43:24,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 04:43:24,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,401 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 04:43:24,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 04:43:24,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 04:43:24,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 04:43:24,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 04:43:24,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (1/1) ... [2024-11-01 04:43:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 04:43:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:43:24,451 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 04:43:24,458 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 04:43:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 04:43:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 04:43:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 04:43:24,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 04:43:24,555 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 04:43:24,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 04:43:24,716 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-01 04:43:24,716 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 04:43:24,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 04:43:24,729 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 04:43:24,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:43:24 BoogieIcfgContainer [2024-11-01 04:43:24,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 04:43:24,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 04:43:24,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 04:43:24,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 04:43:24,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:43:24" (1/3) ... [2024-11-01 04:43:24,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5880896d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:43:24, skipping insertion in model container [2024-11-01 04:43:24,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:43:24" (2/3) ... [2024-11-01 04:43:24,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5880896d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:43:24, skipping insertion in model container [2024-11-01 04:43:24,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:43:24" (3/3) ... [2024-11-01 04:43:24,735 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-01 04:43:24,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 04:43:24,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 04:43:24,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 04:43:24,804 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;@1034c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 04:43:24,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 04:43:24,811 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 04:43:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 04:43:24,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 04:43:24,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 04:43:24,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 04:43:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 04:43:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 04:43:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 04:43:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612830963] [2024-11-01 04:43:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 04:43:24,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:43:24,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:43:24,835 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 04:43:24,837 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 04:43:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 04:43:24,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-01 04:43:24,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 04:43:25,132 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 04:43:25,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 04:43:25,284 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 04:43:25,284 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 04:43:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612830963] [2024-11-01 04:43:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1612830963] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 04:43:25,285 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 04:43:25,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 04:43:25,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874412402] [2024-11-01 04:43:25,288 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 04:43:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 04:43:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 04:43:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 04:43:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 04:43:25,310 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 04:43:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 04:43:25,341 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-01 04:43:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 04:43:25,343 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 04:43:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 04:43:25,347 INFO L225 Difference]: With dead ends: 18 [2024-11-01 04:43:25,347 INFO L226 Difference]: Without dead ends: 10 [2024-11-01 04:43:25,349 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 04:43:25,352 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 04:43:25,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 04:43:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-01 04:43:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-01 04:43:25,370 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 04:43:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 04:43:25,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 04:43:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 04:43:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 04:43:25,372 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 04:43:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 04:43:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 04:43:25,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 04:43:25,372 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 04:43:25,392 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 04:43:25,573 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 04:43:25,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 04:43:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 04:43:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 04:43:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 04:43:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296016243] [2024-11-01 04:43:25,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 04:43:25,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:43:25,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:43:25,579 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 04:43:25,580 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 04:43:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 04:43:25,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-01 04:43:25,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 04:43:25,820 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 04:43:25,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 04:43:26,277 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 04:43:26,278 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 04:43:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296016243] [2024-11-01 04:43:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1296016243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 04:43:26,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 04:43:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 04:43:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298505662] [2024-11-01 04:43:26,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 04:43:26,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 04:43:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 04:43:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 04:43:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-01 04:43:26,281 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 04:43:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 04:43:26,344 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-01 04:43:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 04:43:26,345 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 04:43:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 04:43:26,345 INFO L225 Difference]: With dead ends: 15 [2024-11-01 04:43:26,346 INFO L226 Difference]: Without dead ends: 13 [2024-11-01 04:43:26,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-01 04:43:26,347 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 04:43:26,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 04:43:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-01 04:43:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-01 04:43:26,352 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-01 04:43:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-01 04:43:26,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-01 04:43:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 04:43:26,353 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-01 04:43:26,354 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 04:43:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-01 04:43:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-01 04:43:26,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 04:43:26,355 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-01 04:43:26,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-01 04:43:26,556 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 04:43:26,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 04:43:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 04:43:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-01 04:43:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 04:43:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435528691] [2024-11-01 04:43:26,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 04:43:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:43:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:43:26,560 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 04:43:26,560 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 04:43:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 04:43:26,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-01 04:43:26,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 04:43:26,926 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-01 04:43:26,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 04:43:27,840 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-01 04:43:27,841 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 04:43:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435528691] [2024-11-01 04:43:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1435528691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 04:43:27,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 04:43:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-01 04:43:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392940054] [2024-11-01 04:43:27,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 04:43:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-01 04:43:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 04:43:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-01 04:43:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-01 04:43:27,845 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-01 04:43:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 04:43:28,354 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-01 04:43:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-01 04:43:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-01 04:43:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 04:43:28,355 INFO L225 Difference]: With dead ends: 24 [2024-11-01 04:43:28,355 INFO L226 Difference]: Without dead ends: 22 [2024-11-01 04:43:28,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-01 04:43:28,356 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 04:43:28,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 04:43:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-01 04:43:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-01 04:43:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 04:43:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-01 04:43:28,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2024-11-01 04:43:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 04:43:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-01 04:43:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-01 04:43:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-01 04:43:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-01 04:43:28,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 04:43:28,362 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2024-11-01 04:43:28,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-01 04:43:28,565 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 04:43:28,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 04:43:28,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 04:43:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1003628899, now seen corresponding path program 3 times [2024-11-01 04:43:28,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 04:43:28,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794957424] [2024-11-01 04:43:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 04:43:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:43:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:43:28,569 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 04:43:28,570 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 04:43:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 04:43:28,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-01 04:43:28,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 04:43:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 04:43:29,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 04:43:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 04:43:32,985 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 04:43:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794957424] [2024-11-01 04:43:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [794957424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 04:43:32,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 04:43:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-01 04:43:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769716931] [2024-11-01 04:43:32,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 04:43:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-01 04:43:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 04:43:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-01 04:43:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-01 04:43:32,988 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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 04:43:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 04:43:36,363 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-01 04:43:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-01 04:43:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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 20 [2024-11-01 04:43:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 04:43:36,364 INFO L225 Difference]: With dead ends: 42 [2024-11-01 04:43:36,364 INFO L226 Difference]: Without dead ends: 40 [2024-11-01 04:43:36,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2024-11-01 04:43:36,365 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-01 04:43:36,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 31 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-01 04:43:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-01 04:43:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-01 04:43:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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 04:43:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-01 04:43:36,378 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 20 [2024-11-01 04:43:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 04:43:36,378 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-01 04:43:36,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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 04:43:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-01 04:43:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-01 04:43:36,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 04:43:36,379 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2024-11-01 04:43:36,395 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 04:43:36,580 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 04:43:36,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 04:43:36,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 04:43:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1673576541, now seen corresponding path program 4 times [2024-11-01 04:43:36,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 04:43:36,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304555049] [2024-11-01 04:43:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 04:43:36,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:43:36,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:43:36,583 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 04:43:36,584 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 04:43:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 04:43:36,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-01 04:43:36,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 04:43:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 04:43:37,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 04:43:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 04:43:49,469 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 04:43:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304555049] [2024-11-01 04:43:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [304555049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 04:43:49,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 04:43:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2024-11-01 04:43:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611591029] [2024-11-01 04:43:49,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 04:43:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-01 04:43:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 04:43:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-01 04:43:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2024-11-01 04:43:49,474 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 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 04:44:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 04:44:08,309 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-01 04:44:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-01 04:44:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 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 38 [2024-11-01 04:44:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 04:44:08,310 INFO L225 Difference]: With dead ends: 80 [2024-11-01 04:44:08,310 INFO L226 Difference]: Without dead ends: 78 [2024-11-01 04:44:08,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=971, Invalid=2935, Unknown=0, NotChecked=0, Total=3906 [2024-11-01 04:44:08,313 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-01 04:44:08,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 57 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-01 04:44:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-01 04:44:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-01 04:44:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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 04:44:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-01 04:44:08,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 38 [2024-11-01 04:44:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 04:44:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-01 04:44:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 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 04:44:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-01 04:44:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-01 04:44:08,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 04:44:08,345 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-01 04:44:08,360 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 04:44:08,546 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 04:44:08,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 04:44:08,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 04:44:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 5 times [2024-11-01 04:44:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 04:44:08,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275984679] [2024-11-01 04:44:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 04:44:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:44:08,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 04:44:08,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-01 04:44:08,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-01 04:44:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 04:44:08,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 04:44:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 04:44:08,875 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 04:44:08,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 04:44:08,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 04:44:08,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-01 04:44:09,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-01 04:44:09,081 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1] [2024-11-01 04:44:09,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 04:44:09,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 04:44:09 BoogieIcfgContainer [2024-11-01 04:44:09,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 04:44:09,143 INFO L158 Benchmark]: Toolchain (without parser) took 45073.43ms. Allocated memory was 191.9MB in the beginning and 562.0MB in the end (delta: 370.1MB). Free memory was 146.7MB in the beginning and 250.2MB in the end (delta: -103.5MB). Peak memory consumption was 267.7MB. Max. memory is 8.0GB. [2024-11-01 04:44:09,144 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 04:44:09,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.58ms. Allocated memory is still 191.9MB. Free memory was 146.7MB in the beginning and 131.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-01 04:44:09,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.70ms. Allocated memory is still 191.9MB. Free memory was 131.9MB in the beginning and 129.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 04:44:09,144 INFO L158 Benchmark]: Boogie Preprocessor took 48.21ms. Allocated memory is still 191.9MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 04:44:09,144 INFO L158 Benchmark]: RCFGBuilder took 305.97ms. Allocated memory is still 191.9MB. Free memory was 127.8MB in the beginning and 112.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-01 04:44:09,145 INFO L158 Benchmark]: TraceAbstraction took 44412.19ms. Allocated memory was 191.9MB in the beginning and 562.0MB in the end (delta: 370.1MB). Free memory was 111.6MB in the beginning and 250.2MB in the end (delta: -138.6MB). Peak memory consumption was 233.1MB. Max. memory is 8.0GB. [2024-11-01 04:44:09,146 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.11ms. Allocated memory is still 191.9MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.58ms. Allocated memory is still 191.9MB. Free memory was 146.7MB in the beginning and 131.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.70ms. Allocated memory is still 191.9MB. Free memory was 131.9MB in the beginning and 129.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.21ms. Allocated memory is still 191.9MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 305.97ms. Allocated memory is still 191.9MB. Free memory was 127.8MB in the beginning and 112.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 44412.19ms. Allocated memory was 191.9MB in the beginning and 562.0MB in the end (delta: 370.1MB). Free memory was 111.6MB in the beginning and 250.2MB in the end (delta: -138.6MB). Peak memory consumption was 233.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 20 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 154 ConstructedInterpolants, 62 QuantifiedInterpolants, 70622 SizeOfPredicates, 21 NumberOfNonLiveVariables, 519 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 0/472 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 04:44:09,186 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...