./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:16:32,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:16:32,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:16:32,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:16:32,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:16:33,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:16:33,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:16:33,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:16:33,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:16:33,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:16:33,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:16:33,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:16:33,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:16:33,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:16:33,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:16:33,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:16:33,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:16:33,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:16:33,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:16:33,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:16:33,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:16:33,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:16:33,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:16:33,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:16:33,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:16:33,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:16:33,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:16:33,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:16:33,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:16:33,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:16:33,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:16:33,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:16:33,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:16:33,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:16:33,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:16:33,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:16:33,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:16:33,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:16:33,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:16:33,019 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 [2024-11-08 18:16:33,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:16:33,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:16:33,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:16:33,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:16:33,377 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:16:33,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2024-11-08 18:16:35,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:16:35,321 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:16:35,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2024-11-08 18:16:35,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd77745e/02dfc1cb0b4744a290141752aa7b3bd7/FLAG41760cd1a [2024-11-08 18:16:35,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd77745e/02dfc1cb0b4744a290141752aa7b3bd7 [2024-11-08 18:16:35,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:16:35,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:16:35,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:16:35,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:16:35,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:16:35,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:35,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1034845b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35, skipping insertion in model container [2024-11-08 18:16:35,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:35,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:16:35,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2024-11-08 18:16:35,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:16:35,760 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:16:35,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2024-11-08 18:16:35,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:16:35,855 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:16:35,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35 WrapperNode [2024-11-08 18:16:35,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:16:35,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:16:35,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:16:35,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:16:35,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:35,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,001 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 599 [2024-11-08 18:16:36,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:16:36,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:16:36,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:16:36,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:16:36,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,093 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-08 18:16:36,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:16:36,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:16:36,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:16:36,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:16:36,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (1/1) ... [2024-11-08 18:16:36,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:16:36,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:16:36,255 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-08 18:16:36,275 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-08 18:16:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:16:36,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:16:36,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:16:36,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:16:36,543 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:16:36,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:16:37,392 INFO L? ?]: Removed 260 outVars from TransFormulas that were not future-live. [2024-11-08 18:16:37,393 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:16:37,411 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:16:37,411 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:16:37,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:16:37 BoogieIcfgContainer [2024-11-08 18:16:37,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:16:37,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:16:37,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:16:37,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:16:37,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:16:35" (1/3) ... [2024-11-08 18:16:37,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598fbb25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:16:37, skipping insertion in model container [2024-11-08 18:16:37,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:35" (2/3) ... [2024-11-08 18:16:37,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598fbb25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:16:37, skipping insertion in model container [2024-11-08 18:16:37,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:16:37" (3/3) ... [2024-11-08 18:16:37,420 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v7.c [2024-11-08 18:16:37,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:16:37,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:16:37,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:16:37,524 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;@5636e9fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:16:37,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:16:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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-08 18:16:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 18:16:37,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:16:37,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:37,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:16:37,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash 761713907, now seen corresponding path program 1 times [2024-11-08 18:16:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:16:37,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231162532] [2024-11-08 18:16:37,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:16:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:38,510 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-08 18:16:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:16:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231162532] [2024-11-08 18:16:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231162532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:16:38,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:16:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:16:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687601475] [2024-11-08 18:16:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:38,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:16:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:16:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:16:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:38,568 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 18:16:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:16:38,631 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2024-11-08 18:16:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:16:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-08 18:16:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:16:38,651 INFO L225 Difference]: With dead ends: 177 [2024-11-08 18:16:38,651 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 18:16:38,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:38,657 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:16:38,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:16:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 18:16:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-08 18:16:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 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-08 18:16:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-11-08 18:16:38,700 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 55 [2024-11-08 18:16:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:16:38,701 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-11-08 18:16:38,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 18:16:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-11-08 18:16:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 18:16:38,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:16:38,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:38,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:16:38,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:16:38,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2139990115, now seen corresponding path program 1 times [2024-11-08 18:16:38,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:16:38,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348639015] [2024-11-08 18:16:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:16:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:38,964 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-08 18:16:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:16:38,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348639015] [2024-11-08 18:16:38,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348639015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:16:38,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:16:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:16:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390334714] [2024-11-08 18:16:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:16:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:16:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:16:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:38,972 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-08 18:16:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:16:39,021 INFO L93 Difference]: Finished difference Result 178 states and 259 transitions. [2024-11-08 18:16:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:16:39,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-08 18:16:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:16:39,026 INFO L225 Difference]: With dead ends: 178 [2024-11-08 18:16:39,026 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 18:16:39,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:39,027 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:16:39,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:16:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 18:16:39,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-08 18:16:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 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-08 18:16:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2024-11-08 18:16:39,047 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 56 [2024-11-08 18:16:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:16:39,048 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2024-11-08 18:16:39,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-08 18:16:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2024-11-08 18:16:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 18:16:39,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:16:39,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:16:39,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:16:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash 817218508, now seen corresponding path program 1 times [2024-11-08 18:16:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:16:39,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816368465] [2024-11-08 18:16:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:16:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:39,512 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-08 18:16:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:16:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816368465] [2024-11-08 18:16:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816368465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:16:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:16:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:16:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155902161] [2024-11-08 18:16:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:39,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:16:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:16:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:16:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:39,518 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-08 18:16:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:16:39,566 INFO L93 Difference]: Finished difference Result 178 states and 258 transitions. [2024-11-08 18:16:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:16:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2024-11-08 18:16:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:16:39,568 INFO L225 Difference]: With dead ends: 178 [2024-11-08 18:16:39,568 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 18:16:39,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:16:39,570 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 138 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:16:39,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 357 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:16:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 18:16:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-08 18:16:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4609375) internal successors, (187), 128 states have internal predecessors, (187), 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-08 18:16:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 187 transitions. [2024-11-08 18:16:39,592 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 187 transitions. Word has length 57 [2024-11-08 18:16:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:16:39,593 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 187 transitions. [2024-11-08 18:16:39,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-08 18:16:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 187 transitions. [2024-11-08 18:16:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 18:16:39,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:16:39,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:39,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:16:39,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:16:39,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1128515398, now seen corresponding path program 1 times [2024-11-08 18:16:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:16:39,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707626073] [2024-11-08 18:16:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:16:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:16:39,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:16:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:16:39,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:16:39,771 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:16:39,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:16:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:16:39,779 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 18:16:39,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:16:39,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:16:39 BoogieIcfgContainer [2024-11-08 18:16:39,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:16:39,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:16:39,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:16:39,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:16:39,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:16:37" (3/4) ... [2024-11-08 18:16:39,857 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:16:39,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:16:39,861 INFO L158 Benchmark]: Toolchain (without parser) took 4505.09ms. Allocated memory was 182.5MB in the beginning and 325.1MB in the end (delta: 142.6MB). Free memory was 110.3MB in the beginning and 250.2MB in the end (delta: -139.8MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-08 18:16:39,861 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 182.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:16:39,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.44ms. Allocated memory is still 182.5MB. Free memory was 110.0MB in the beginning and 89.3MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 18:16:39,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.69ms. Allocated memory is still 182.5MB. Free memory was 89.3MB in the beginning and 77.1MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 18:16:39,863 INFO L158 Benchmark]: Boogie Preprocessor took 165.51ms. Allocated memory is still 182.5MB. Free memory was 76.8MB in the beginning and 68.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:16:39,863 INFO L158 Benchmark]: RCFGBuilder took 1243.76ms. Allocated memory is still 182.5MB. Free memory was 68.9MB in the beginning and 78.2MB in the end (delta: -9.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-08 18:16:39,864 INFO L158 Benchmark]: TraceAbstraction took 2437.76ms. Allocated memory was 182.5MB in the beginning and 325.1MB in the end (delta: 142.6MB). Free memory was 77.3MB in the beginning and 251.2MB in the end (delta: -173.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:16:39,864 INFO L158 Benchmark]: Witness Printer took 5.97ms. Allocated memory is still 325.1MB. Free memory was 251.2MB in the beginning and 250.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:16:39,865 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.32ms. Allocated memory is still 182.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.44ms. Allocated memory is still 182.5MB. Free memory was 110.0MB in the beginning and 89.3MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.69ms. Allocated memory is still 182.5MB. Free memory was 89.3MB in the beginning and 77.1MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.51ms. Allocated memory is still 182.5MB. Free memory was 76.8MB in the beginning and 68.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1243.76ms. Allocated memory is still 182.5MB. Free memory was 68.9MB in the beginning and 78.2MB in the end (delta: -9.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2437.76ms. Allocated memory was 182.5MB in the beginning and 325.1MB in the end (delta: 142.6MB). Free memory was 77.3MB in the beginning and 251.2MB in the end (delta: -173.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.97ms. Allocated memory is still 325.1MB. Free memory was 251.2MB in the beginning and 250.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 155. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_22 = 0; [L34] const SORT_5 var_31 = 1; [L35] const SORT_1 var_109 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_35; [L44] SORT_5 input_37; [L45] SORT_5 input_39; [L46] SORT_5 input_51; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L48] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L49] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L50] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L51] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L52] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L53] SORT_5 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L54] SORT_5 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L55] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L56] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L57] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L58] SORT_5 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L59] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L60] SORT_5 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L61] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L62] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L63] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L64] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L65] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L66] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L67] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_11_arg_1 = var_9; [L70] state_10 = init_11_arg_1 [L71] SORT_1 init_13_arg_1 = var_9; [L72] state_12 = init_13_arg_1 [L73] SORT_1 init_19_arg_1 = var_9; [L74] state_18 = init_19_arg_1 [L75] SORT_5 init_24_arg_1 = var_22; [L76] state_23 = init_24_arg_1 [L77] SORT_1 init_27_arg_1 = var_9; [L78] state_26 = init_27_arg_1 [L79] SORT_5 init_42_arg_1 = var_22; [L80] state_41 = init_42_arg_1 [L81] SORT_5 init_44_arg_1 = var_22; [L82] state_43 = init_44_arg_1 [L83] SORT_1 init_46_arg_1 = var_9; [L84] state_45 = init_46_arg_1 [L85] SORT_1 init_48_arg_1 = var_9; [L86] state_47 = init_48_arg_1 [L87] SORT_1 init_50_arg_1 = var_9; [L88] state_49 = init_50_arg_1 [L89] SORT_5 init_54_arg_1 = var_22; [L90] state_53 = init_54_arg_1 [L91] SORT_1 init_56_arg_1 = var_9; [L92] state_55 = init_56_arg_1 [L93] SORT_5 init_58_arg_1 = var_22; [L94] state_57 = init_58_arg_1 [L95] SORT_1 init_60_arg_1 = var_9; [L96] state_59 = init_60_arg_1 [L97] SORT_1 init_63_arg_1 = var_9; [L98] state_62 = init_63_arg_1 [L99] SORT_1 init_65_arg_1 = var_9; [L100] state_64 = init_65_arg_1 [L101] SORT_1 init_67_arg_1 = var_9; [L102] state_66 = init_67_arg_1 [L103] SORT_1 init_69_arg_1 = var_9; [L104] state_68 = init_69_arg_1 [L105] SORT_1 init_71_arg_1 = var_9; [L106] state_70 = init_71_arg_1 [L107] SORT_1 init_73_arg_1 = var_9; [L108] state_72 = init_73_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] EXPR input_8 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_16=0, var_22=0, var_31=1, var_9=0] [L126] EXPR var_16 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_25=0, var_31=1, var_9=0] [L147] EXPR var_25 & mask_SORT_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_9=0] [L155] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] EXPR var_33 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 1451 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 902 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 549 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:16:39,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:16:42,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:16:42,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:16:42,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:16:42,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:16:42,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:16:42,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:16:42,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:16:42,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:16:42,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:16:42,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:16:42,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:16:42,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:16:42,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:16:42,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:16:42,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:16:42,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:16:42,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:16:42,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:16:42,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:16:42,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:16:42,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:16:42,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:16:42,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:16:42,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:16:42,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:16:42,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:16:42,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:16:42,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:16:42,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:16:42,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:16:42,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:16:42,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:16:42,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:16:42,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:16:42,568 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:16:42,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:16:42,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:16:42,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:16:42,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:16:42,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:16:42,572 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 [2024-11-08 18:16:42,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:16:42,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:16:42,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:16:42,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:16:42,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:16:42,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2024-11-08 18:16:44,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:16:45,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:16:45,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2024-11-08 18:16:45,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1a9c2ed/6e181c7971b745cab84410c631c8f450/FLAG3f5e682f6 [2024-11-08 18:16:45,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1a9c2ed/6e181c7971b745cab84410c631c8f450 [2024-11-08 18:16:45,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:16:45,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:16:45,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:16:45,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:16:45,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:16:45,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:45,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2d0e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45, skipping insertion in model container [2024-11-08 18:16:45,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:45,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:16:45,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2024-11-08 18:16:45,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:16:45,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:16:45,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2024-11-08 18:16:45,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:16:45,951 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:16:45,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45 WrapperNode [2024-11-08 18:16:45,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:16:45,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:16:45,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:16:45,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:16:45,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:45,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,032 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 359 [2024-11-08 18:16:46,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:16:46,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:16:46,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:16:46,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:16:46,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,092 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-08 18:16:46,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:16:46,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:16:46,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:16:46,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:16:46,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (1/1) ... [2024-11-08 18:16:46,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:16:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:16:46,190 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-08 18:16:46,195 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-08 18:16:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:16:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:16:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:16:46,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:16:46,394 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:16:46,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:16:46,725 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-11-08 18:16:46,725 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:16:46,736 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:16:46,736 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:16:46,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:16:46 BoogieIcfgContainer [2024-11-08 18:16:46,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:16:46,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:16:46,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:16:46,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:16:46,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:16:45" (1/3) ... [2024-11-08 18:16:46,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb9c3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:16:46, skipping insertion in model container [2024-11-08 18:16:46,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:16:45" (2/3) ... [2024-11-08 18:16:46,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb9c3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:16:46, skipping insertion in model container [2024-11-08 18:16:46,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:16:46" (3/3) ... [2024-11-08 18:16:46,750 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v7.c [2024-11-08 18:16:46,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:16:46,768 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:16:46,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:16:46,833 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;@9f454ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:16:46,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:16:46,838 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-08 18:16:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:16:46,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:16:46,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:16:46,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:16:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:16:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:16:46,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957448778] [2024-11-08 18:16:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:16:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:16:46,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:16:46,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:16:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:47,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 18:16:47,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:47,438 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-08 18:16:47,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:16:47,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:16:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957448778] [2024-11-08 18:16:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957448778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:16:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:16:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:16:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931085458] [2024-11-08 18:16:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:16:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:16:47,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:16:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:47,476 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 18:16:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:16:47,522 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-08 18:16:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:16:47,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 18:16:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:16:47,532 INFO L225 Difference]: With dead ends: 17 [2024-11-08 18:16:47,533 INFO L226 Difference]: Without dead ends: 9 [2024-11-08 18:16:47,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:16:47,540 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:16:47,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:16:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-08 18:16:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-08 18:16:47,575 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-08 18:16:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:16:47,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:16:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:16:47,578 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:16:47,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 18:16:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:16:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:16:47,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:16:47,579 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:47,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 18:16:47,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:16:47,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:16:47,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:47,784 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 18:16:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:16:47,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725708040] [2024-11-08 18:16:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:16:47,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:16:47,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:16:47,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:16:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:47,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 18:16:47,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:48,464 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-08 18:16:48,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:16:55,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_64~0#1|)))) (.cse11 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_43~0#1|))))))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_59~0#1|) (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_55~0#1|)))))))))) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|)))) (.cse15 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))) .cse27))))) (let ((.cse19 (not .cse15)) (.cse16 (bvneg .cse18)) (.cse20 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse31 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse31))))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse30)))))))) (.cse13 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse18)) .cse27)) (_ bv0 8))) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))) .cse27)) (_ bv0 8)))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse29)))))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ 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_33_arg_0~0#1_10|)))) .cse27))))) (.cse9 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse28))))))) (.cse8 (not .cse11)) (.cse6 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_72~0#1|))))) (.cse12 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) .cse7))))))) (and (or (and (or (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|)))))))))))))))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse2 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse2)))))))) (or (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 .cse1 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse4)))))) .cse5))) .cse8) (or (and (or .cse5 .cse9) (or .cse0 .cse10)) .cse11)) (not .cse12)) (or .cse13 (and (or .cse0 (and (or .cse14 .cse15) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse17 ((_ 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) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse17))))))) .cse19))) (or (and (or .cse20 .cse15) (or .cse19 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse21 ((_ 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) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse21)))))))) .cse5))) (or (and (or .cse19 (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse18))))) .cse16))))))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse22)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24)))))) .cse5)))) (or (and (or .cse5 .cse20) (or .cse0 .cse14)) .cse15)) (not .cse13)) (or (and (or .cse0 (and (or .cse11 .cse10) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse25)))))))))) (or .cse5 (and (or .cse11 .cse9) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse26)))))))))) .cse12))))) is different from false [2024-11-08 18:16:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 18:16:59,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:16:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725708040] [2024-11-08 18:16:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725708040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:16:59,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:16:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 18:16:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033875838] [2024-11-08 18:16:59,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:16:59,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:16:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:16:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:16:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-08 18:16:59,610 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:17:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:17:01,291 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-08 18:17:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:17:01,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 18:17:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:17:01,293 INFO L225 Difference]: With dead ends: 14 [2024-11-08 18:17:01,293 INFO L226 Difference]: Without dead ends: 12 [2024-11-08 18:17:01,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-11-08 18:17:01,295 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:17:01,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 5 Unchecked, 0.4s Time] [2024-11-08 18:17:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-08 18:17:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-08 18:17:01,302 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-08 18:17:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-08 18:17:01,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-08 18:17:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:17:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-08 18:17:01,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:17:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-08 18:17:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 18:17:01,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:17:01,309 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-08 18:17:01,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:17:01,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:17:01,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:17:01,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:17:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-08 18:17:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:17:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245414252] [2024-11-08 18:17:01,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:17:01,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:17:01,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:17:01,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:17:01,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 18:17:01,731 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:17:01,732 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:17:01,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 18:17:01,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:17:07,811 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-08 18:17:07,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:18:04,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|))))) (let ((.cse34 (bvneg .cse0))) (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_109~0#1|)) (.cse70 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse0)))))) (.cse75 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|)))) (.cse63 ((_ zero_extend 24) ((_ extract 7 0) .cse0))) (.cse71 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse59 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_62~0#1|)))))) (.cse72 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_45~0#1|)) (.cse73 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_47~0#1|)) (.cse74 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_49~0#1|)))))) (let ((.cse14 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_70~0#1|))))))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 (bvneg .cse73)))))))) .cse74)))))))) (.cse11 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse71 ((_ zero_extend 24) ((_ extract 7 0) .cse59)))))) (.cse24 (bvneg .cse63)) (.cse21 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse63)) .cse71)))) (.cse58 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse75)) .cse71)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) .cse70))) (.cse55 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse75 .cse71)))) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_16|) (_ bv254 32)))) .cse71))))) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 .cse73))))))) .cse74)))))))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 .cse4)))) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_16|) (_ bv255 32)))) .cse71)) (_ bv0 8)))) (.cse60 (= ((_ extract 7 0) (bvand .cse71 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_41~0#1|))))))) (_ bv0 8))) (.cse32 (= ((_ extract 7 0) (bvand .cse63 .cse71)) (_ bv0 8)))) (let ((.cse10 (not .cse32)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse70 .cse34)))))) (.cse12 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse68))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse68))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse3))) .cse4))))) .cse5) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse69))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse69)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse3))) .cse4))))) .cse7)) .cse60)) (.cse20 (or (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse66)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse3))) .cse4)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse67))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse67))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse3))) .cse4))))) .cse5)) .cse55)) (.cse27 (or .cse58 (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse64))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse64)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse3))) .cse4)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse65))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse3))) .cse4))))) .cse5)))) (.cse39 (not .cse21)) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse63 .cse24))))) .cse24)))))) (.cse31 (not .cse11)) (.cse43 (or .cse60 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse61 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse61))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse61))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse3))) .cse4)))) .cse5) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse62 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse62))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse62)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 .cse3))) .cse4)))) .cse7)))) (.cse13 (not .cse60)) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_66~0#1|)))))) .cse59))))) .cse14)))))) (.cse26 (not .cse58)) (.cse40 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse56))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse56 .cse3))) .cse4)))) .cse5) (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse57))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse57)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse3))) .cse4)))))) .cse58)) (.cse8 (not .cse55)) (.cse9 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse53))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse53))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse3))) .cse4)))) .cse5) (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse54))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse54)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 .cse3))) .cse4)))))) .cse55))) (and (or (and (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse1))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse3))) .cse4)))) .cse5) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse6)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse3))) .cse4)))) .cse7)) .cse8) .cse9) .cse10) (or .cse11 (and .cse12 (or .cse13 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse15))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse3))) .cse4))))) .cse5) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse17)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse3))) .cse4))))) .cse7))))) (or .cse10 (and (or (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse18)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse3))) .cse4)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse19))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse3))) .cse4))))) .cse5)) .cse8) .cse20)) (or .cse21 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse23)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse3))) .cse4))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse25))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse3))) .cse4))))) .cse5)) .cse26) .cse27)) (or (and (or .cse13 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse29)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 .cse3))) .cse4))))) .cse7) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse30))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse30))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse3))) .cse4))))) .cse5))) .cse12) .cse31) (or .cse32 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse33 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse33)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse33 .cse3))) .cse4))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse35))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse3))) .cse4))))) .cse5)) .cse8) .cse20)) (or (and (or .cse26 (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse36))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse37)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse3))) .cse4)))))) (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse3))) .cse4)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse38))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse37))))))))))) .cse27) .cse39) (or .cse39 (and .cse40 (or .cse26 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse3))) .cse4) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse37)))))))) .cse5) (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse37)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse3))) .cse4))))))))) (or .cse11 (and .cse43 (or .cse13 (and (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse44))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse44)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 .cse3))) .cse4))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse46))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse46))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse3))) .cse4)))) .cse5))))) (or .cse31 (and .cse43 (or .cse13 (and (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse47))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse47))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse47 .cse3))) .cse4))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse48))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse48)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse3))) .cse4)))) .cse7))))) (or (and (or (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse49))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse49))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse3))) .cse4))))) (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse50))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse50)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse3))) .cse4)))))) .cse26) .cse40) .cse21) (or .cse32 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse51))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse3))) .cse4)))) .cse5) (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse52)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 .cse3))) .cse4)))))) .cse8) .cse9)))))))) is different from false