/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.eq_sdp_v3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 16:13:41,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 16:13:41,826 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-04 16:13:41,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 16:13:41,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 16:13:41,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 16:13:41,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 16:13:41,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 16:13:41,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 16:13:41,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 16:13:41,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 16:13:41,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 16:13:41,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 16:13:41,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 16:13:41,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 16:13:41,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 16:13:41,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 16:13:41,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 16:13:41,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 16:13:41,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 16:13:41,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 16:13:41,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 16:13:41,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 16:13:41,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 16:13:41,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 16:13:41,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 16:13:41,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 16:13:41,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 16:13:41,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 16:13:41,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 16:13:41,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 16:13:41,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 16:13:41,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 16:13:41,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 16:13:41,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 16:13:41,869 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-04 16:13:42,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 16:13:42,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 16:13:42,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 16:13:42,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 16:13:42,087 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 16:13:42,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-11-04 16:13:43,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 16:13:43,771 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 16:13:43,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-11-04 16:13:43,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9971395a/08e0506536f34a61bab57ba02d61cdd6/FLAG729ee8da3 [2024-11-04 16:13:43,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9971395a/08e0506536f34a61bab57ba02d61cdd6 [2024-11-04 16:13:43,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 16:13:43,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 16:13:43,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 16:13:43,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 16:13:43,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 16:13:43,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 04:13:43" (1/1) ... [2024-11-04 16:13:43,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76763e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:43, skipping insertion in model container [2024-11-04 16:13:43,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 04:13:43" (1/1) ... [2024-11-04 16:13:43,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 16:13:43,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-11-04 16:13:44,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 16:13:44,026 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 16:13:44,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-11-04 16:13:44,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 16:13:44,078 INFO L204 MainTranslator]: Completed translation [2024-11-04 16:13:44,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44 WrapperNode [2024-11-04 16:13:44,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 16:13:44,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 16:13:44,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 16:13:44,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 16:13:44,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,123 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2024-11-04 16:13:44,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 16:13:44,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 16:13:44,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 16:13:44,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 16:13:44,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,156 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-04 16:13:44,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 16:13:44,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 16:13:44,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 16:13:44,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 16:13:44,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (1/1) ... [2024-11-04 16:13:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 16:13:44,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:13:44,232 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-04 16:13:44,244 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-04 16:13:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 16:13:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 16:13:44,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 16:13:44,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 16:13:44,373 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 16:13:44,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 16:13:44,704 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-04 16:13:44,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 16:13:44,716 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 16:13:44,716 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-04 16:13:44,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 04:13:44 BoogieIcfgContainer [2024-11-04 16:13:44,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 16:13:44,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 16:13:44,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 16:13:44,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 16:13:44,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 04:13:43" (1/3) ... [2024-11-04 16:13:44,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224cc3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 04:13:44, skipping insertion in model container [2024-11-04 16:13:44,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:13:44" (2/3) ... [2024-11-04 16:13:44,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224cc3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 04:13:44, skipping insertion in model container [2024-11-04 16:13:44,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 04:13:44" (3/3) ... [2024-11-04 16:13:44,726 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2024-11-04 16:13:44,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 16:13:44,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 16:13:44,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 16:13:44,794 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;@2fe5aaa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 16:13:44,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 16:13:44,798 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-04 16:13:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-04 16:13:44,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:13:44,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-04 16:13:44,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:13:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:13:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-04 16:13:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:13:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597127425] [2024-11-04 16:13:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:13:44,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:13:44,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:13:44,826 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-04 16:13:44,827 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-04 16:13:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:13:44,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-04 16:13:44,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:13:45,074 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-04 16:13:45,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:13:45,191 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-04 16:13:45,192 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:13:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597127425] [2024-11-04 16:13:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1597127425] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 16:13:45,192 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 16:13:45,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-04 16:13:45,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236847533] [2024-11-04 16:13:45,194 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 16:13:45,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 16:13:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:13:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 16:13:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-04 16:13:45,218 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-04 16:13:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:13:45,249 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-04 16:13:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 16:13:45,254 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-04 16:13:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:13:45,260 INFO L225 Difference]: With dead ends: 17 [2024-11-04 16:13:45,260 INFO L226 Difference]: Without dead ends: 9 [2024-11-04 16:13:45,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-04 16:13:45,266 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 16:13:45,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 16:13:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-04 16:13:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-04 16:13:45,289 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-04 16:13:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-04 16:13:45,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-04 16:13:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:13:45,291 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-04 16:13:45,291 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-04 16:13:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-04 16:13:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-04 16:13:45,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:13:45,292 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-04 16:13:45,308 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-04 16:13:45,496 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-04 16:13:45,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:13:45,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:13:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-04 16:13:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:13:45,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114017975] [2024-11-04 16:13:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:13:45,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:13:45,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:13:45,501 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-04 16:13:45,502 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-04 16:13:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:13:45,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-04 16:13:45,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:13:45,868 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-04 16:13:45,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:13:50,221 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-04 16:13:50,221 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:13:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114017975] [2024-11-04 16:13:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2114017975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:13:50,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:13:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-04 16:13:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248431409] [2024-11-04 16:13:50,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:13:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-04 16:13:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:13:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-04 16:13:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-04 16:13:50,224 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-04 16:13:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:13:50,773 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-04 16:13:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 16:13:50,774 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-04 16:13:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:13:50,774 INFO L225 Difference]: With dead ends: 14 [2024-11-04 16:13:50,774 INFO L226 Difference]: Without dead ends: 12 [2024-11-04 16:13:50,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-04 16:13:50,775 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-04 16:13:50,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-04 16:13:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-04 16:13:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-04 16:13:50,778 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-04 16:13:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-04 16:13:50,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-04 16:13:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:13:50,779 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-04 16:13:50,779 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-04 16:13:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-04 16:13:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-04 16:13:50,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:13:50,780 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-04 16:13:50,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-04 16:13:50,983 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-04 16:13:50,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:13:50,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:13:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-04 16:13:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:13:50,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586816202] [2024-11-04 16:13:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:13:50,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:13:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:13:50,987 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-04 16:13:50,994 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-04 16:13:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:13:51,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-04 16:13:51,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:13:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 16:13:54,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:14:08,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_17|)))) .cse23))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_17|)))) .cse23))))) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|)))) .cse23)))) (.cse1 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|))))) (let ((.cse8 (bvneg .cse3)) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse10 (not .cse1)) (.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse17 (not .cse0)) (.cse13 (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) .cse19))) (.cse18 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8)))) (and .cse7 (or (not .cse18) (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (bvneg .cse19)))))))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse19 (_ bv2 32)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))))) .cse18 .cse6)))))) (and (or .cse0 (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse12))))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse3))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4)))))) .cse6) .cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse8))))))) .cse9))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse9)))))) .cse10 .cse6)))) (or .cse0 .cse13) (or (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse11) .cse12))))))))) (and (or .cse1 .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse3))))))) .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse15))))))) .cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse8))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse16)))))) .cse10 .cse6))) .cse17) (or .cse17 .cse13))))) is different from false [2024-11-04 16:14:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-04 16:14:18,043 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:14:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586816202] [2024-11-04 16:14:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1586816202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:14:18,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:14:18,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-11-04 16:14:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796478229] [2024-11-04 16:14:18,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:14:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-04 16:14:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:14:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-04 16:14:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2024-11-04 16:14:18,051 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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-04 16:14:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:14:29,508 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-04 16:14:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-04 16:14:29,511 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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-04 16:14:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:14:29,515 INFO L225 Difference]: With dead ends: 17 [2024-11-04 16:14:29,515 INFO L226 Difference]: Without dead ends: 15 [2024-11-04 16:14:29,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=73, Invalid=202, Unknown=1, NotChecked=30, Total=306 [2024-11-04 16:14:29,516 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-04 16:14:29,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 9 Unchecked, 1.6s Time] [2024-11-04 16:14:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-04 16:14:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-04 16:14:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-04 16:14:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-04 16:14:29,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-04 16:14:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:14:29,529 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-04 16:14:29,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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-04 16:14:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-04 16:14:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-04 16:14:29,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:14:29,530 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-04 16:14:29,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-04 16:14:29,731 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-04 16:14:29,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:14:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:14:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-04 16:14:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:14:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288935481] [2024-11-04 16:14:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:14:29,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:14:29,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:14:29,735 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-04 16:14:29,736 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-04 16:14:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-04 16:14:29,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-04 16:14:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-04 16:14:30,134 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-04 16:14:30,134 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-04 16:14:30,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-04 16:14:30,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-04 16:14:30,340 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-04 16:14:30,344 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-04 16:14:30,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-04 16:14:30,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.11 04:14:30 BoogieIcfgContainer [2024-11-04 16:14:30,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-04 16:14:30,411 INFO L158 Benchmark]: Toolchain (without parser) took 46615.74ms. Allocated memory was 327.2MB in the beginning and 405.8MB in the end (delta: 78.6MB). Free memory was 277.9MB in the beginning and 355.5MB in the end (delta: -77.7MB). Peak memory consumption was 1.8MB. Max. memory is 8.0GB. [2024-11-04 16:14:30,411 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory was 164.7MB in the beginning and 164.6MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-04 16:14:30,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.76ms. Allocated memory is still 327.2MB. Free memory was 277.6MB in the beginning and 260.1MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-04 16:14:30,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.74ms. Allocated memory is still 327.2MB. Free memory was 260.1MB in the beginning and 257.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-04 16:14:30,412 INFO L158 Benchmark]: Boogie Preprocessor took 60.12ms. Allocated memory is still 327.2MB. Free memory was 257.4MB in the beginning and 254.1MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-04 16:14:30,413 INFO L158 Benchmark]: RCFGBuilder took 531.72ms. Allocated memory is still 327.2MB. Free memory was 254.1MB in the beginning and 291.1MB in the end (delta: -37.1MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2024-11-04 16:14:30,413 INFO L158 Benchmark]: TraceAbstraction took 45691.80ms. Allocated memory was 327.2MB in the beginning and 405.8MB in the end (delta: 78.6MB). Free memory was 290.1MB in the beginning and 355.5MB in the end (delta: -65.4MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2024-11-04 16:14:30,418 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.10ms. Allocated memory is still 213.9MB. Free memory was 164.7MB in the beginning and 164.6MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.76ms. Allocated memory is still 327.2MB. Free memory was 277.6MB in the beginning and 260.1MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.74ms. Allocated memory is still 327.2MB. Free memory was 260.1MB in the beginning and 257.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.12ms. Allocated memory is still 327.2MB. Free memory was 257.4MB in the beginning and 254.1MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 531.72ms. Allocated memory is still 327.2MB. Free memory was 254.1MB in the beginning and 291.1MB in the end (delta: -37.1MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. * TraceAbstraction took 45691.80ms. Allocated memory was 327.2MB in the beginning and 405.8MB in the end (delta: 78.6MB). Free memory was 290.1MB in the beginning and 355.5MB in the end (delta: -65.4MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_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: 45.6s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 15 QuantifiedInterpolants, 3214 SizeOfPredicates, 17 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-04 16:14:30,636 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-04 16:14:30,752 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 137 Received shutdown request...