./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7f92922ffa71366d540d70f941bc1459bfdc5c51893e6ae68b25745b7371220 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:11:16,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:11:16,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:11:16,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:11:16,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:11:16,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:11:16,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:11:16,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:11:16,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:11:16,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:11:16,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:11:16,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:11:16,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:11:16,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:11:16,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:11:16,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:16,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:11:16,448 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b7f92922ffa71366d540d70f941bc1459bfdc5c51893e6ae68b25745b7371220 [2025-02-08 00:11:16,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:11:16,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:11:16,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:11:16,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:11:16,760 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:11:16,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c [2025-02-08 00:11:18,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d859b1407/c8a7af6f395b4375b1573b450fda5fc1/FLAGe7b9c320e [2025-02-08 00:11:18,457 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:11:18,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c [2025-02-08 00:11:18,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d859b1407/c8a7af6f395b4375b1573b450fda5fc1/FLAGe7b9c320e [2025-02-08 00:11:18,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d859b1407/c8a7af6f395b4375b1573b450fda5fc1 [2025-02-08 00:11:18,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:11:18,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:11:18,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:18,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:11:18,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:11:18,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:18" (1/1) ... [2025-02-08 00:11:18,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:18, skipping insertion in model container [2025-02-08 00:11:18,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:18" (1/1) ... [2025-02-08 00:11:18,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:11:18,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c[1258,1271] [2025-02-08 00:11:18,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:18,976 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:11:18,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c[1258,1271] [2025-02-08 00:11:19,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:19,127 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:11:19,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19 WrapperNode [2025-02-08 00:11:19,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:19,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:19,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:11:19,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:11:19,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,296 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 918 [2025-02-08 00:11:19,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:19,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:11:19,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:11:19,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:11:19,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,363 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]. [2025-02-08 00:11:19,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:11:19,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:11:19,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:11:19,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:11:19,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (1/1) ... [2025-02-08 00:11:19,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:19,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:11:19,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:11:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:11:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:11:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:11:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:11:19,624 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:11:19,626 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:11:20,513 INFO L? ?]: Removed 442 outVars from TransFormulas that were not future-live. [2025-02-08 00:11:20,514 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:11:20,566 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:11:20,568 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:11:20,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:20 BoogieIcfgContainer [2025-02-08 00:11:20,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:11:20,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:11:20,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:11:20,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:11:20,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:11:18" (1/3) ... [2025-02-08 00:11:20,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16253fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:20, skipping insertion in model container [2025-02-08 00:11:20,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:19" (2/3) ... [2025-02-08 00:11:20,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16253fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:20, skipping insertion in model container [2025-02-08 00:11:20,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:20" (3/3) ... [2025-02-08 00:11:20,578 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p1.c [2025-02-08 00:11:20,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:11:20,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_fru32_p1.c that has 1 procedures, 236 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:11:20,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:11:20,663 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;@34b4e574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:11:20,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:11:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 234 states have (on average 1.5) internal successors, (351), 235 states have internal predecessors, (351), 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) [2025-02-08 00:11:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 00:11:20,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:20,680 INFO L218 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, 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] [2025-02-08 00:11:20,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash 639024342, now seen corresponding path program 1 times [2025-02-08 00:11:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390281794] [2025-02-08 00:11:20,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:20,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 00:11:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 00:11:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390281794] [2025-02-08 00:11:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390281794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135723894] [2025-02-08 00:11:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:21,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:21,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:21,775 INFO L87 Difference]: Start difference. First operand has 236 states, 234 states have (on average 1.5) internal successors, (351), 235 states have internal predecessors, (351), 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 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2025-02-08 00:11:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:21,932 INFO L93 Difference]: Finished difference Result 403 states and 601 transitions. [2025-02-08 00:11:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2025-02-08 00:11:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:21,941 INFO L225 Difference]: With dead ends: 403 [2025-02-08 00:11:21,941 INFO L226 Difference]: Without dead ends: 236 [2025-02-08 00:11:21,943 INFO L434 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 [2025-02-08 00:11:21,945 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:21,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 862 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-08 00:11:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-02-08 00:11:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.4893617021276595) internal successors, (350), 235 states have internal predecessors, (350), 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) [2025-02-08 00:11:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 350 transitions. [2025-02-08 00:11:21,977 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 350 transitions. Word has length 108 [2025-02-08 00:11:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:21,977 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 350 transitions. [2025-02-08 00:11:21,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2025-02-08 00:11:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 350 transitions. [2025-02-08 00:11:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 00:11:21,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:21,980 INFO L218 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, 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] [2025-02-08 00:11:21,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:11:21,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1660402700, now seen corresponding path program 1 times [2025-02-08 00:11:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117217516] [2025-02-08 00:11:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:22,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 00:11:22,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 00:11:22,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:22,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:22,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117217516] [2025-02-08 00:11:22,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117217516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:22,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:22,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561152179] [2025-02-08 00:11:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:22,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:22,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:22,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:22,520 INFO L87 Difference]: Start difference. First operand 236 states and 350 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2025-02-08 00:11:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:22,637 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2025-02-08 00:11:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:22,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 109 [2025-02-08 00:11:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:22,639 INFO L225 Difference]: With dead ends: 405 [2025-02-08 00:11:22,639 INFO L226 Difference]: Without dead ends: 238 [2025-02-08 00:11:22,640 INFO L434 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 [2025-02-08 00:11:22,640 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:22,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-08 00:11:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-08 00:11:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 237 states have internal predecessors, (352), 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) [2025-02-08 00:11:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 352 transitions. [2025-02-08 00:11:22,653 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 352 transitions. Word has length 109 [2025-02-08 00:11:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 352 transitions. [2025-02-08 00:11:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2025-02-08 00:11:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 352 transitions. [2025-02-08 00:11:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 00:11:22,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:22,656 INFO L218 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, 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] [2025-02-08 00:11:22,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:11:22,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:22,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1998633105, now seen corresponding path program 1 times [2025-02-08 00:11:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504719069] [2025-02-08 00:11:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:22,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 00:11:22,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 00:11:22,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:22,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504719069] [2025-02-08 00:11:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504719069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:23,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:23,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691531996] [2025-02-08 00:11:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:23,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:23,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:23,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:23,184 INFO L87 Difference]: Start difference. First operand 238 states and 352 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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) [2025-02-08 00:11:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:23,306 INFO L93 Difference]: Finished difference Result 409 states and 604 transitions. [2025-02-08 00:11:23,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2025-02-08 00:11:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:23,308 INFO L225 Difference]: With dead ends: 409 [2025-02-08 00:11:23,308 INFO L226 Difference]: Without dead ends: 240 [2025-02-08 00:11:23,309 INFO L434 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 [2025-02-08 00:11:23,309 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:23,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-08 00:11:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-02-08 00:11:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.4811715481171548) internal successors, (354), 239 states have internal predecessors, (354), 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) [2025-02-08 00:11:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 354 transitions. [2025-02-08 00:11:23,319 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 354 transitions. Word has length 110 [2025-02-08 00:11:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:23,319 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 354 transitions. [2025-02-08 00:11:23,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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) [2025-02-08 00:11:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 354 transitions. [2025-02-08 00:11:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-08 00:11:23,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:23,327 INFO L218 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, 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] [2025-02-08 00:11:23,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:11:23,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:23,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -578520647, now seen corresponding path program 1 times [2025-02-08 00:11:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131467704] [2025-02-08 00:11:23,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:23,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 00:11:23,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 00:11:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131467704] [2025-02-08 00:11:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131467704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:11:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085353758] [2025-02-08 00:11:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:11:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:24,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:11:24,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:11:24,094 INFO L87 Difference]: Start difference. First operand 240 states and 354 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 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) [2025-02-08 00:11:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:24,371 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2025-02-08 00:11:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:11:24,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 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 111 [2025-02-08 00:11:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:24,373 INFO L225 Difference]: With dead ends: 497 [2025-02-08 00:11:24,373 INFO L226 Difference]: Without dead ends: 326 [2025-02-08 00:11:24,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:11:24,376 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 505 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:24,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1681 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-08 00:11:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-08 00:11:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4830769230769232) internal successors, (482), 325 states have internal predecessors, (482), 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) [2025-02-08 00:11:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 482 transitions. [2025-02-08 00:11:24,393 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 482 transitions. Word has length 111 [2025-02-08 00:11:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:24,394 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 482 transitions. [2025-02-08 00:11:24,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 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) [2025-02-08 00:11:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 482 transitions. [2025-02-08 00:11:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 00:11:24,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:24,395 INFO L218 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, 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] [2025-02-08 00:11:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:11:24,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:24,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1272136605, now seen corresponding path program 1 times [2025-02-08 00:11:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459109463] [2025-02-08 00:11:24,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:24,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 00:11:24,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 00:11:24,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:24,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:24,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459109463] [2025-02-08 00:11:24,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459109463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:24,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:24,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123041353] [2025-02-08 00:11:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:24,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:24,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:24,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:24,816 INFO L87 Difference]: Start difference. First operand 326 states and 482 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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) [2025-02-08 00:11:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:25,013 INFO L93 Difference]: Finished difference Result 725 states and 1073 transitions. [2025-02-08 00:11:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2025-02-08 00:11:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:25,015 INFO L225 Difference]: With dead ends: 725 [2025-02-08 00:11:25,017 INFO L226 Difference]: Without dead ends: 468 [2025-02-08 00:11:25,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:25,018 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 549 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:25,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 833 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-08 00:11:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 369. [2025-02-08 00:11:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.483695652173913) internal successors, (546), 368 states have internal predecessors, (546), 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) [2025-02-08 00:11:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 546 transitions. [2025-02-08 00:11:25,032 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 546 transitions. Word has length 112 [2025-02-08 00:11:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:25,032 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 546 transitions. [2025-02-08 00:11:25,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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) [2025-02-08 00:11:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 546 transitions. [2025-02-08 00:11:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-08 00:11:25,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:25,034 INFO L218 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, 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] [2025-02-08 00:11:25,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:11:25,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:25,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash -235093111, now seen corresponding path program 1 times [2025-02-08 00:11:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35914446] [2025-02-08 00:11:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:25,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 00:11:25,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 00:11:25,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:25,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:25,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35914446] [2025-02-08 00:11:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35914446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:25,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741814070] [2025-02-08 00:11:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:25,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:25,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:25,399 INFO L87 Difference]: Start difference. First operand 369 states and 546 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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) [2025-02-08 00:11:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:25,568 INFO L93 Difference]: Finished difference Result 675 states and 998 transitions. [2025-02-08 00:11:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:25,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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 113 [2025-02-08 00:11:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:25,570 INFO L225 Difference]: With dead ends: 675 [2025-02-08 00:11:25,570 INFO L226 Difference]: Without dead ends: 417 [2025-02-08 00:11:25,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:25,572 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 563 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:25,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 840 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-08 00:11:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 368. [2025-02-08 00:11:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.4822888283378746) internal successors, (544), 367 states have internal predecessors, (544), 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) [2025-02-08 00:11:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 544 transitions. [2025-02-08 00:11:25,584 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 544 transitions. Word has length 113 [2025-02-08 00:11:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:25,585 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 544 transitions. [2025-02-08 00:11:25,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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) [2025-02-08 00:11:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 544 transitions. [2025-02-08 00:11:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:11:25,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:25,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-02-08 00:11:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:11:25,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:25,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1946011737, now seen corresponding path program 1 times [2025-02-08 00:11:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16445399] [2025-02-08 00:11:25,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:25,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:11:25,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:11:25,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:25,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16445399] [2025-02-08 00:11:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16445399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541126457] [2025-02-08 00:11:26,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:26,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:11:26,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:11:26,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:11:26,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:11:26,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:26,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 00:11:26,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:27,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:11:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541126457] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:11:27,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:11:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-08 00:11:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431798900] [2025-02-08 00:11:27,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:11:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:11:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:11:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:11:27,861 INFO L87 Difference]: Start difference. First operand 368 states and 544 transitions. Second operand has 15 states, 15 states have (on average 22.6) internal successors, (339), 14 states have internal predecessors, (339), 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) [2025-02-08 00:11:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:28,779 INFO L93 Difference]: Finished difference Result 1046 states and 1546 transitions. [2025-02-08 00:11:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:11:28,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 22.6) internal successors, (339), 14 states have internal predecessors, (339), 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 195 [2025-02-08 00:11:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:28,786 INFO L225 Difference]: With dead ends: 1046 [2025-02-08 00:11:28,787 INFO L226 Difference]: Without dead ends: 789 [2025-02-08 00:11:28,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-02-08 00:11:28,788 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 917 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:28,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3635 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:11:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-08 00:11:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 625. [2025-02-08 00:11:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4807692307692308) internal successors, (924), 624 states have internal predecessors, (924), 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) [2025-02-08 00:11:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 924 transitions. [2025-02-08 00:11:28,831 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 924 transitions. Word has length 195 [2025-02-08 00:11:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:28,832 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 924 transitions. [2025-02-08 00:11:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 22.6) internal successors, (339), 14 states have internal predecessors, (339), 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) [2025-02-08 00:11:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 924 transitions. [2025-02-08 00:11:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-08 00:11:28,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:28,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:28,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:11:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:29,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:29,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1872242907, now seen corresponding path program 1 times [2025-02-08 00:11:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033333838] [2025-02-08 00:11:29,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:29,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 00:11:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 00:11:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033333838] [2025-02-08 00:11:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033333838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416528618] [2025-02-08 00:11:29,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:29,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:11:29,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:11:30,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 00:11:30,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 00:11:30,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:30,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:30,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 00:11:30,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:30,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:11:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416528618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:11:31,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:11:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2025-02-08 00:11:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656744635] [2025-02-08 00:11:31,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:11:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 00:11:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:31,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 00:11:31,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-08 00:11:31,923 INFO L87 Difference]: Start difference. First operand 625 states and 924 transitions. Second operand has 21 states, 21 states have (on average 22.857142857142858) internal successors, (480), 20 states have internal predecessors, (480), 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) [2025-02-08 00:11:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:33,836 INFO L93 Difference]: Finished difference Result 1914 states and 2829 transitions. [2025-02-08 00:11:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 00:11:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 22.857142857142858) internal successors, (480), 20 states have internal predecessors, (480), 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 196 [2025-02-08 00:11:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:33,842 INFO L225 Difference]: With dead ends: 1914 [2025-02-08 00:11:33,842 INFO L226 Difference]: Without dead ends: 1358 [2025-02-08 00:11:33,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2025-02-08 00:11:33,845 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 2639 mSDsluCounter, 7337 mSDsCounter, 0 mSdLazyCounter, 3211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 8096 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:33,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 8096 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3211 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:11:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-02-08 00:11:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 971. [2025-02-08 00:11:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.477319587628866) internal successors, (1433), 970 states have internal predecessors, (1433), 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) [2025-02-08 00:11:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1433 transitions. [2025-02-08 00:11:33,873 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1433 transitions. Word has length 196 [2025-02-08 00:11:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:33,873 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1433 transitions. [2025-02-08 00:11:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 22.857142857142858) internal successors, (480), 20 states have internal predecessors, (480), 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) [2025-02-08 00:11:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1433 transitions. [2025-02-08 00:11:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-08 00:11:33,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:33,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:33,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 00:11:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:34,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:34,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1208642540, now seen corresponding path program 1 times [2025-02-08 00:11:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808436702] [2025-02-08 00:11:34,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:34,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-08 00:11:34,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 00:11:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 00:11:35,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:35,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808436702] [2025-02-08 00:11:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808436702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:35,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669329108] [2025-02-08 00:11:35,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:35,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:35,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:11:35,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:11:35,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-08 00:11:35,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 00:11:35,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:35,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:35,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-08 00:11:35,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 00:11:36,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:11:36,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669329108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:36,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:11:36,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2025-02-08 00:11:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416029447] [2025-02-08 00:11:36,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:36,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:36,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:11:36,438 INFO L87 Difference]: Start difference. First operand 971 states and 1433 transitions. Second operand has 9 states, 9 states have (on average 21.22222222222222) internal successors, (191), 8 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) [2025-02-08 00:11:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:37,016 INFO L93 Difference]: Finished difference Result 2173 states and 3213 transitions. [2025-02-08 00:11:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:37,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.22222222222222) internal successors, (191), 8 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) Word has length 197 [2025-02-08 00:11:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:37,022 INFO L225 Difference]: With dead ends: 2173 [2025-02-08 00:11:37,022 INFO L226 Difference]: Without dead ends: 1271 [2025-02-08 00:11:37,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:11:37,024 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 326 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:37,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1240 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:11:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-02-08 00:11:37,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1001. [2025-02-08 00:11:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 1.463) internal successors, (1463), 1000 states have internal predecessors, (1463), 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) [2025-02-08 00:11:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1463 transitions. [2025-02-08 00:11:37,049 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1463 transitions. Word has length 197 [2025-02-08 00:11:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:37,049 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1463 transitions. [2025-02-08 00:11:37,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.22222222222222) internal successors, (191), 8 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) [2025-02-08 00:11:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1463 transitions. [2025-02-08 00:11:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-08 00:11:37,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:37,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:37,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 00:11:37,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:37,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 300137684, now seen corresponding path program 1 times [2025-02-08 00:11:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:37,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379219151] [2025-02-08 00:11:37,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:37,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 00:11:38,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 00:11:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:38,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:11:38,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 00:11:38,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 00:11:38,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:38,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:11:38,631 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:11:38,633 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:11:38,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:11:38,637 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:38,755 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:38,756 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:38,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:11:38,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:11:38 BoogieIcfgContainer [2025-02-08 00:11:38,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:11:38,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:11:38,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:11:38,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:11:38,806 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:20" (3/4) ... [2025-02-08 00:11:38,808 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:11:38,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:11:38,810 INFO L158 Benchmark]: Toolchain (without parser) took 20154.45ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 105.1MB in the beginning and 362.4MB in the end (delta: -257.3MB). Peak memory consumption was 360.0MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.02ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 83.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.59ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 65.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: Boogie Preprocessor took 136.34ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 54.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: IcfgBuilder took 1133.19ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 52.4MB in the end (delta: 2.5MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: TraceAbstraction took 18231.07ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 51.6MB in the beginning and 362.5MB in the end (delta: -310.9MB). Peak memory consumption was 297.8MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,811 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 755.0MB. Free memory was 362.5MB in the beginning and 362.4MB in the end (delta: 76.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:38,812 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.67ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.02ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 83.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.59ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 65.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.34ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 54.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1133.19ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 52.4MB in the end (delta: 2.5MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18231.07ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 51.6MB in the beginning and 362.5MB in the end (delta: -310.9MB). Peak memory consumption was 297.8MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 755.0MB. Free memory was 362.5MB in the beginning and 362.4MB in the end (delta: 76.1kB). Peak memory consumption was 8.4MB. 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 143. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 5); [L36] const SORT_24 msb_SORT_24 = (SORT_24)1 << (5 - 1); [L38] const SORT_33 mask_SORT_33 = (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 2); [L39] const SORT_33 msb_SORT_33 = (SORT_33)1 << (2 - 1); [L41] const SORT_1 var_21 = 0; [L42] const SORT_24 var_26 = 31; [L43] const SORT_6 var_28 = 0; [L44] const SORT_33 var_34 = 0; [L45] const SORT_33 var_35 = 1; [L46] const SORT_3 var_37 = 1; [L47] const SORT_3 var_43 = 0; [L48] const SORT_33 var_55 = 2; [L49] const SORT_33 var_72 = 3; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_117; [L69] SORT_3 input_121; [L70] SORT_1 input_123; [L71] SORT_3 input_125; [L72] SORT_33 input_128; [L73] SORT_3 input_130; [L74] SORT_6 input_133; [L75] SORT_3 input_135; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L77] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L78] SORT_6 state_29 = __VERIFIER_nondet_uint() & mask_SORT_6; [L79] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L79] SORT_6 state_31 = __VERIFIER_nondet_uint() & mask_SORT_6; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L80] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L81] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L82] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L83] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L84] SORT_3 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L85] SORT_3 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L86] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L87] SORT_3 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L88] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, mask_SORT_6=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L89] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L90] SORT_6 state_95 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L91] SORT_1 state_113 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L92] SORT_3 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_43=0, var_55=2, var_72=3] [L93] SORT_3 state_119 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_23_arg_1 = var_21; [L96] state_22 = init_23_arg_1 [L97] SORT_6 init_30_arg_1 = var_28; [L98] state_29 = init_30_arg_1 [L99] SORT_6 init_32_arg_1 = var_28; [L100] state_31 = init_32_arg_1 [L101] SORT_1 init_40_arg_1 = var_21; [L102] state_39 = init_40_arg_1 [L103] SORT_3 init_45_arg_1 = var_43; [L104] state_44 = init_45_arg_1 [L105] SORT_3 init_49_arg_1 = var_43; [L106] state_48 = init_49_arg_1 [L107] SORT_1 init_58_arg_1 = var_21; [L108] state_57 = init_58_arg_1 [L109] SORT_3 init_62_arg_1 = var_43; [L110] state_61 = init_62_arg_1 [L111] SORT_3 init_66_arg_1 = var_43; [L112] state_65 = init_66_arg_1 [L113] SORT_1 init_75_arg_1 = var_21; [L114] state_74 = init_75_arg_1 [L115] SORT_3 init_79_arg_1 = var_43; [L116] state_78 = init_79_arg_1 [L117] SORT_3 init_83_arg_1 = var_43; [L118] state_82 = init_83_arg_1 [L119] SORT_3 init_87_arg_1 = var_43; [L120] state_86 = init_87_arg_1 [L121] SORT_6 init_96_arg_1 = var_28; [L122] state_95 = init_96_arg_1 [L123] SORT_1 init_114_arg_1 = var_21; [L124] state_113 = init_114_arg_1 [L125] SORT_3 init_116_arg_1 = var_43; [L126] state_115 = init_116_arg_1 [L127] SORT_3 init_120_arg_1 = var_43; [L128] state_119 = init_120_arg_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=31, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_117 = __VERIFIER_nondet_uchar() [L159] input_121 = __VERIFIER_nondet_uchar() [L160] input_123 = __VERIFIER_nondet_uchar() [L161] input_125 = __VERIFIER_nondet_uchar() [L162] input_128 = __VERIFIER_nondet_uchar() [L163] input_130 = __VERIFIER_nondet_uchar() [L164] input_133 = __VERIFIER_nondet_uint() [L165] input_135 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_25_arg_0 = state_22; [L169] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_25=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L170] EXPR var_25 & mask_SORT_24 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L170] var_25 = var_25 & mask_SORT_24 [L171] SORT_24 var_27_arg_0 = var_25; [L172] SORT_24 var_27_arg_1 = var_26; [L173] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_24 var_102_arg_0 = var_25; [L175] SORT_24 var_102_arg_1 = var_26; [L176] SORT_3 var_102 = var_102_arg_0 == var_102_arg_1; [L177] SORT_1 var_36_arg_0 = state_22; [L178] SORT_3 var_36 = var_36_arg_0 >> 5; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L179] EXPR var_36 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L179] var_36 = var_36 & mask_SORT_3 [L180] SORT_3 var_73_arg_0 = var_36; [L181] SORT_3 var_73_arg_1 = var_37; [L182] SORT_3 var_73 = var_73_arg_0 == var_73_arg_1; [L183] SORT_1 var_76_arg_0 = state_22; [L184] SORT_1 var_76_arg_1 = state_74; [L185] SORT_3 var_76 = var_76_arg_0 == var_76_arg_1; [L186] SORT_3 var_77_arg_0 = var_73; [L187] SORT_3 var_77_arg_1 = var_76; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_77_arg_0=0, var_77_arg_1=1] [L188] EXPR var_77_arg_0 & var_77_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L188] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L189] SORT_3 var_80_arg_0 = state_78; [L190] SORT_3 var_80_arg_1 = var_37; [L191] SORT_3 var_80 = var_80_arg_0 != var_80_arg_1; [L192] SORT_3 var_81_arg_0 = var_77; [L193] SORT_3 var_81_arg_1 = var_80; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_81_arg_0=0, var_81_arg_1=1] [L194] EXPR var_81_arg_0 & var_81_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L194] SORT_3 var_81 = var_81_arg_0 & var_81_arg_1; [L195] SORT_3 var_84_arg_0 = state_82; [L196] SORT_3 var_84_arg_1 = var_37; [L197] SORT_3 var_84 = var_84_arg_0 == var_84_arg_1; [L198] SORT_3 var_85_arg_0 = var_81; [L199] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_85_arg_0=0, var_85_arg_1=0] [L200] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_86=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L200] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L201] SORT_3 var_88_arg_0 = state_86; [L202] SORT_3 var_88_arg_1 = var_37; [L203] SORT_3 var_88 = var_88_arg_0 == var_88_arg_1; [L204] SORT_3 var_89_arg_0 = var_85; [L205] SORT_3 var_89_arg_1 = var_88; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_89_arg_0=0, var_89_arg_1=0] [L206] EXPR var_89_arg_0 & var_89_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L206] SORT_3 var_89 = var_89_arg_0 & var_89_arg_1; [L207] SORT_24 var_90_arg_0 = var_25; [L208] SORT_24 var_90_arg_1 = var_26; [L209] SORT_3 var_90 = var_90_arg_0 != var_90_arg_1; [L210] SORT_3 var_91_arg_0 = var_89; [L211] SORT_3 var_91_arg_1 = var_90; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91_arg_0=0, var_91_arg_1=1] [L212] EXPR var_91_arg_0 & var_91_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L212] SORT_3 var_91 = var_91_arg_0 & var_91_arg_1; [L213] EXPR var_91 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L213] var_91 = var_91 & mask_SORT_3 [L214] SORT_3 var_56_arg_0 = var_36; [L215] SORT_3 var_56_arg_1 = var_37; [L216] SORT_3 var_56 = var_56_arg_0 == var_56_arg_1; [L217] SORT_1 var_59_arg_0 = state_22; [L218] SORT_1 var_59_arg_1 = state_57; [L219] SORT_3 var_59 = var_59_arg_0 == var_59_arg_1; [L220] SORT_3 var_60_arg_0 = var_56; [L221] SORT_3 var_60_arg_1 = var_59; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_60_arg_0=0, var_60_arg_1=1, var_72=3, var_91=0] [L222] EXPR var_60_arg_0 & var_60_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L222] SORT_3 var_60 = var_60_arg_0 & var_60_arg_1; [L223] SORT_3 var_63_arg_0 = state_61; [L224] SORT_3 var_63_arg_1 = var_37; [L225] SORT_3 var_63 = var_63_arg_0 == var_63_arg_1; [L226] SORT_3 var_64_arg_0 = var_60; [L227] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_64_arg_0=0, var_64_arg_1=0, var_72=3, var_91=0] [L228] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L228] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L229] SORT_3 var_67_arg_0 = state_65; [L230] SORT_3 var_67_arg_1 = var_37; [L231] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L232] SORT_3 var_68_arg_0 = var_64; [L233] SORT_3 var_68_arg_1 = var_67; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_68_arg_0=0, var_68_arg_1=0, var_72=3, var_91=0] [L234] EXPR var_68_arg_0 & var_68_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L234] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L235] SORT_24 var_69_arg_0 = var_25; [L236] SORT_24 var_69_arg_1 = var_26; [L237] SORT_3 var_69 = var_69_arg_0 != var_69_arg_1; [L238] SORT_3 var_70_arg_0 = var_68; [L239] SORT_3 var_70_arg_1 = var_69; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_70_arg_0=0, var_70_arg_1=1, var_72=3, var_91=0] [L240] EXPR var_70_arg_0 & var_70_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L240] SORT_3 var_70 = var_70_arg_0 & var_70_arg_1; [L241] EXPR var_70 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L241] var_70 = var_70 & mask_SORT_3 [L242] SORT_3 var_38_arg_0 = var_36; [L243] SORT_3 var_38_arg_1 = var_37; [L244] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L245] SORT_1 var_41_arg_0 = state_22; [L246] SORT_1 var_41_arg_1 = state_39; [L247] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L248] SORT_3 var_42_arg_0 = var_38; [L249] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_42_arg_0=0, var_42_arg_1=1, var_55=2, var_70=0, var_72=3, var_91=0] [L250] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L250] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L251] SORT_3 var_46_arg_0 = state_44; [L252] SORT_3 var_46_arg_1 = var_37; [L253] SORT_3 var_46 = var_46_arg_0 == var_46_arg_1; [L254] SORT_3 var_47_arg_0 = var_42; [L255] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_47_arg_0=0, var_47_arg_1=0, var_55=2, var_70=0, var_72=3, var_91=0] [L256] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L256] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L257] SORT_3 var_50_arg_0 = state_48; [L258] SORT_3 var_50_arg_1 = var_37; [L259] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L260] SORT_3 var_51_arg_0 = var_47; [L261] SORT_3 var_51_arg_1 = var_50; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_51_arg_0=0, var_51_arg_1=0, var_55=2, var_70=0, var_72=3, var_91=0] [L262] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_25=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L262] SORT_3 var_51 = var_51_arg_0 & var_51_arg_1; [L263] SORT_24 var_52_arg_0 = var_25; [L264] SORT_24 var_52_arg_1 = var_26; [L265] SORT_3 var_52 = var_52_arg_0 != var_52_arg_1; [L266] SORT_3 var_53_arg_0 = var_51; [L267] SORT_3 var_53_arg_1 = var_52; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_53_arg_0=0, var_53_arg_1=1, var_55=2, var_70=0, var_72=3, var_91=0] [L268] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L268] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L269] EXPR var_53 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L269] var_53 = var_53 & mask_SORT_3 [L270] SORT_3 var_54_arg_0 = var_53; [L271] SORT_33 var_54_arg_1 = var_35; [L272] SORT_33 var_54_arg_2 = var_34; [L273] SORT_33 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L274] SORT_3 var_71_arg_0 = var_70; [L275] SORT_33 var_71_arg_1 = var_55; [L276] SORT_33 var_71_arg_2 = var_54; [L277] SORT_33 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L278] SORT_3 var_92_arg_0 = var_91; [L279] SORT_33 var_92_arg_1 = var_72; [L280] SORT_33 var_92_arg_2 = var_71; [L281] SORT_33 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0] [L282] EXPR var_92 & mask_SORT_33 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L282] var_92 = var_92 & mask_SORT_33 [L283] SORT_33 var_99_arg_0 = var_92; [L284] SORT_33 var_99_arg_1 = var_35; [L285] SORT_3 var_99 = var_99_arg_0 == var_99_arg_1; [L286] SORT_33 var_97_arg_0 = var_92; [L287] SORT_33 var_97_arg_1 = var_34; [L288] SORT_3 var_97 = var_97_arg_0 == var_97_arg_1; [L289] SORT_3 var_100_arg_0 = var_99; [L290] SORT_3 var_100_arg_1 = var_97; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_100_arg_0=0, var_100_arg_1=1, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0, var_97=1] [L291] EXPR var_100_arg_0 | var_100_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0, var_97=1] [L291] SORT_3 var_100 = var_100_arg_0 | var_100_arg_1; [L292] EXPR var_100 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0, var_97=1] [L292] var_100 = var_100 & mask_SORT_3 [L293] SORT_3 var_98_arg_0 = var_97; [L294] SORT_6 var_98_arg_1 = var_28; [L295] SORT_6 var_98_arg_2 = state_95; [L296] SORT_6 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L297] SORT_33 var_93_arg_0 = var_92; [L298] SORT_33 var_93_arg_1 = var_55; [L299] SORT_3 var_93 = var_93_arg_0 == var_93_arg_1; [L300] SORT_3 var_94_arg_0 = var_93; [L301] SORT_6 var_94_arg_1 = state_31; [L302] SORT_6 var_94_arg_2 = state_29; [L303] SORT_6 var_94 = var_94_arg_0 ? var_94_arg_1 : var_94_arg_2; [L304] SORT_3 var_101_arg_0 = var_100; [L305] SORT_6 var_101_arg_1 = var_98; [L306] SORT_6 var_101_arg_2 = var_94; [L307] SORT_6 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L308] SORT_3 var_103_arg_0 = var_102; [L309] SORT_6 var_103_arg_1 = var_28; [L310] SORT_6 var_103_arg_2 = var_101; [L311] SORT_6 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L312] SORT_6 var_104_arg_0 = var_103; [L313] SORT_1 var_104 = var_104_arg_0 >> 26; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_104=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L314] EXPR var_104 & mask_SORT_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_27=0, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L314] var_104 = var_104 & mask_SORT_1 [L315] SORT_1 var_105_arg_0 = var_104; [L316] SORT_1 var_105_arg_1 = var_21; [L317] SORT_3 var_105 = var_105_arg_0 == var_105_arg_1; [L318] SORT_3 var_106_arg_0 = var_27; [L319] SORT_3 var_106_arg_1 = var_105; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_106_arg_0=0, var_106_arg_1=1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L320] EXPR var_106_arg_0 & var_106_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L320] SORT_3 var_106 = var_106_arg_0 & var_106_arg_1; [L321] SORT_3 var_107_arg_0 = var_106; [L322] SORT_3 var_107 = ~var_107_arg_0; [L323] SORT_3 var_110_arg_0 = var_107; [L324] SORT_3 var_110 = ~var_110_arg_0; [L325] SORT_3 var_111_arg_0 = var_37; [L326] SORT_3 var_111_arg_1 = var_110; VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_111_arg_0=1, var_111_arg_1=-256, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L327] EXPR var_111_arg_0 & var_111_arg_1 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L327] SORT_3 var_111 = var_111_arg_0 & var_111_arg_1; [L328] EXPR var_111 & mask_SORT_3 VAL [input_10=0, input_11=31, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L328] var_111 = var_111 & mask_SORT_3 [L329] SORT_3 bad_112_arg_0 = var_111; [L330] CALL __VERIFIER_assert(!(bad_112_arg_0)) [L21] COND FALSE !(!(cond)) [L330] RET __VERIFIER_assert(!(bad_112_arg_0)) [L332] SORT_1 next_138_arg_1 = input_11; [L333] SORT_6 next_139_arg_1 = input_7; [L334] SORT_6 next_140_arg_1 = input_9; [L335] SORT_3 var_141_arg_0 = state_119; [L336] SORT_1 var_141_arg_1 = state_57; [L337] SORT_1 var_141_arg_2 = state_39; [L338] SORT_1 var_141 = var_141_arg_0 ? var_141_arg_1 : var_141_arg_2; VAL [input_10=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, state_113=0, state_115=0, state_119=0, state_31=0, state_48=0, state_61=0, state_78=0, state_95=0, var_141=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L339] EXPR var_141 & mask_SORT_1 VAL [input_10=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, state_113=0, state_115=0, state_119=0, state_31=0, state_48=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L339] var_141 = var_141 & mask_SORT_1 [L340] SORT_1 next_142_arg_1 = var_141; [L341] SORT_3 next_143_arg_1 = input_19; [L342] SORT_3 var_144_arg_0 = state_119; [L343] SORT_3 var_144_arg_1 = state_61; [L344] SORT_3 var_144_arg_2 = state_48; [L345] SORT_3 var_144 = var_144_arg_0 ? var_144_arg_1 : var_144_arg_2; VAL [input_10=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, state_113=0, state_115=0, state_119=0, state_31=0, state_78=0, state_95=0, var_144=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L346] EXPR var_144 & mask_SORT_3 VAL [input_10=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, state_113=0, state_115=0, state_119=0, state_31=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L346] var_144 = var_144 & mask_SORT_3 [L347] SORT_3 next_145_arg_1 = var_144; [L348] SORT_1 next_146_arg_1 = input_10; [L349] SORT_3 next_147_arg_1 = input_8; [L350] SORT_3 next_148_arg_1 = input_18; [L351] SORT_1 next_149_arg_1 = input_5; [L352] SORT_1 var_150_arg_0 = state_113; [L353] SORT_3 var_150 = var_150_arg_0 >> 5; [L354] SORT_1 var_151_arg_0 = state_113; [L355] SORT_3 var_151 = var_151_arg_0 >> 2; [L356] SORT_3 var_152_arg_0 = var_150; [L357] SORT_3 var_152_arg_1 = var_151; VAL [input_14=0, input_16=0, input_17=0, input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, next_145_arg_1=0, next_146_arg_1=0, next_147_arg_1=0, next_148_arg_1=0, next_149_arg_1=0, state_113=0, state_115=0, state_119=0, state_31=0, state_78=0, state_95=0, var_152_arg_0=0, var_152_arg_1=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L358] EXPR var_152_arg_0 & var_152_arg_1 VAL [input_14=0, input_16=0, input_17=0, input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, next_145_arg_1=0, next_146_arg_1=0, next_147_arg_1=0, next_148_arg_1=0, next_149_arg_1=0, state_113=0, state_115=0, state_119=0, state_31=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L358] SORT_3 var_152 = var_152_arg_0 & var_152_arg_1; [L359] SORT_1 var_153_arg_0 = state_113; [L360] SORT_3 var_153 = var_153_arg_0 >> 0; [L361] SORT_3 var_154_arg_0 = var_153; [L362] SORT_3 var_154 = ~var_154_arg_0; [L363] SORT_3 var_155_arg_0 = var_152; [L364] SORT_3 var_155_arg_1 = var_154; VAL [input_14=0, input_16=0, input_17=0, input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, next_145_arg_1=0, next_146_arg_1=0, next_147_arg_1=0, next_148_arg_1=0, next_149_arg_1=0, state_115=0, state_119=0, state_31=0, state_78=0, state_95=0, var_155_arg_0=0, var_155_arg_1=-1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L365] EXPR var_155_arg_0 & var_155_arg_1 VAL [input_14=0, input_16=0, input_17=0, input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, next_145_arg_1=0, next_146_arg_1=0, next_147_arg_1=0, next_148_arg_1=0, next_149_arg_1=0, state_115=0, state_119=0, state_31=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L365] SORT_3 var_155 = var_155_arg_0 & var_155_arg_1; [L366] SORT_3 var_156_arg_0 = state_115; [L367] SORT_3 var_156_arg_1 = var_155; [L368] SORT_3 var_156_arg_2 = state_78; [L369] SORT_3 var_156 = var_156_arg_0 ? var_156_arg_1 : var_156_arg_2; VAL [input_14=0, input_16=0, input_17=0, input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, next_145_arg_1=0, next_146_arg_1=0, next_147_arg_1=0, next_148_arg_1=0, next_149_arg_1=0, state_119=0, state_31=0, state_95=0, var_156=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L370] EXPR var_156 & mask_SORT_3 VAL [input_14=0, input_16=0, input_17=0, input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, next_138_arg_1=31, next_139_arg_1=0, next_140_arg_1=0, next_142_arg_1=0, next_143_arg_1=0, next_145_arg_1=0, next_146_arg_1=0, next_147_arg_1=0, next_148_arg_1=0, next_149_arg_1=0, state_119=0, state_31=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L370] var_156 = var_156 & mask_SORT_3 [L371] SORT_3 next_157_arg_1 = var_156; [L372] SORT_3 next_158_arg_1 = input_4; [L373] SORT_3 next_159_arg_1 = input_17; [L374] SORT_3 var_160_arg_0 = state_119; [L375] SORT_6 var_160_arg_1 = state_31; [L376] SORT_6 var_160_arg_2 = state_95; [L377] SORT_6 var_160 = var_160_arg_0 ? var_160_arg_1 : var_160_arg_2; [L378] SORT_6 next_161_arg_1 = var_160; [L379] SORT_1 next_162_arg_1 = input_2; [L380] SORT_3 next_163_arg_1 = input_14; [L381] SORT_3 next_164_arg_1 = input_16; [L383] state_22 = next_138_arg_1 [L384] state_29 = next_139_arg_1 [L385] state_31 = next_140_arg_1 [L386] state_39 = next_142_arg_1 [L387] state_44 = next_143_arg_1 [L388] state_48 = next_145_arg_1 [L389] state_57 = next_146_arg_1 [L390] state_61 = next_147_arg_1 [L391] state_65 = next_148_arg_1 [L392] state_74 = next_149_arg_1 [L393] state_78 = next_157_arg_1 [L394] state_82 = next_158_arg_1 [L395] state_86 = next_159_arg_1 [L396] state_95 = next_161_arg_1 [L397] state_113 = next_162_arg_1 [L398] state_115 = next_163_arg_1 [L399] state_119 = next_164_arg_1 [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_117 = __VERIFIER_nondet_uchar() [L159] input_121 = __VERIFIER_nondet_uchar() [L160] input_123 = __VERIFIER_nondet_uchar() [L161] input_125 = __VERIFIER_nondet_uchar() [L162] input_128 = __VERIFIER_nondet_uchar() [L163] input_130 = __VERIFIER_nondet_uchar() [L164] input_133 = __VERIFIER_nondet_uint() [L165] input_135 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_25_arg_0 = state_22; [L169] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_25=31, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L170] EXPR var_25 & mask_SORT_24 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L170] var_25 = var_25 & mask_SORT_24 [L171] SORT_24 var_27_arg_0 = var_25; [L172] SORT_24 var_27_arg_1 = var_26; [L173] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_24 var_102_arg_0 = var_25; [L175] SORT_24 var_102_arg_1 = var_26; [L176] SORT_3 var_102 = var_102_arg_0 == var_102_arg_1; [L177] SORT_1 var_36_arg_0 = state_22; [L178] SORT_3 var_36 = var_36_arg_0 >> 5; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L179] EXPR var_36 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L179] var_36 = var_36 & mask_SORT_3 [L180] SORT_3 var_73_arg_0 = var_36; [L181] SORT_3 var_73_arg_1 = var_37; [L182] SORT_3 var_73 = var_73_arg_0 == var_73_arg_1; [L183] SORT_1 var_76_arg_0 = state_22; [L184] SORT_1 var_76_arg_1 = state_74; [L185] SORT_3 var_76 = var_76_arg_0 == var_76_arg_1; [L186] SORT_3 var_77_arg_0 = var_73; [L187] SORT_3 var_77_arg_1 = var_76; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_77_arg_0=0, var_77_arg_1=0] [L188] EXPR var_77_arg_0 & var_77_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L188] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L189] SORT_3 var_80_arg_0 = state_78; [L190] SORT_3 var_80_arg_1 = var_37; [L191] SORT_3 var_80 = var_80_arg_0 != var_80_arg_1; [L192] SORT_3 var_81_arg_0 = var_77; [L193] SORT_3 var_81_arg_1 = var_80; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_81_arg_0=0, var_81_arg_1=1] [L194] EXPR var_81_arg_0 & var_81_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_82=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L194] SORT_3 var_81 = var_81_arg_0 & var_81_arg_1; [L195] SORT_3 var_84_arg_0 = state_82; [L196] SORT_3 var_84_arg_1 = var_37; [L197] SORT_3 var_84 = var_84_arg_0 == var_84_arg_1; [L198] SORT_3 var_85_arg_0 = var_81; [L199] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_85_arg_0=0, var_85_arg_1=0] [L200] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_86=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L200] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L201] SORT_3 var_88_arg_0 = state_86; [L202] SORT_3 var_88_arg_1 = var_37; [L203] SORT_3 var_88 = var_88_arg_0 == var_88_arg_1; [L204] SORT_3 var_89_arg_0 = var_85; [L205] SORT_3 var_89_arg_1 = var_88; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_89_arg_0=0, var_89_arg_1=0] [L206] EXPR var_89_arg_0 & var_89_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L206] SORT_3 var_89 = var_89_arg_0 & var_89_arg_1; [L207] SORT_24 var_90_arg_0 = var_25; [L208] SORT_24 var_90_arg_1 = var_26; [L209] SORT_3 var_90 = var_90_arg_0 != var_90_arg_1; [L210] SORT_3 var_91_arg_0 = var_89; [L211] SORT_3 var_91_arg_1 = var_90; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91_arg_0=0, var_91_arg_1=0] [L212] EXPR var_91_arg_0 & var_91_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L212] SORT_3 var_91 = var_91_arg_0 & var_91_arg_1; [L213] EXPR var_91 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3] [L213] var_91 = var_91 & mask_SORT_3 [L214] SORT_3 var_56_arg_0 = var_36; [L215] SORT_3 var_56_arg_1 = var_37; [L216] SORT_3 var_56 = var_56_arg_0 == var_56_arg_1; [L217] SORT_1 var_59_arg_0 = state_22; [L218] SORT_1 var_59_arg_1 = state_57; [L219] SORT_3 var_59 = var_59_arg_0 == var_59_arg_1; [L220] SORT_3 var_60_arg_0 = var_56; [L221] SORT_3 var_60_arg_1 = var_59; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_60_arg_0=0, var_60_arg_1=0, var_72=3, var_91=0] [L222] EXPR var_60_arg_0 & var_60_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L222] SORT_3 var_60 = var_60_arg_0 & var_60_arg_1; [L223] SORT_3 var_63_arg_0 = state_61; [L224] SORT_3 var_63_arg_1 = var_37; [L225] SORT_3 var_63 = var_63_arg_0 == var_63_arg_1; [L226] SORT_3 var_64_arg_0 = var_60; [L227] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_64_arg_0=0, var_64_arg_1=0, var_72=3, var_91=0] [L228] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L228] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L229] SORT_3 var_67_arg_0 = state_65; [L230] SORT_3 var_67_arg_1 = var_37; [L231] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L232] SORT_3 var_68_arg_0 = var_64; [L233] SORT_3 var_68_arg_1 = var_67; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_68_arg_0=0, var_68_arg_1=0, var_72=3, var_91=0] [L234] EXPR var_68_arg_0 & var_68_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L234] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L235] SORT_24 var_69_arg_0 = var_25; [L236] SORT_24 var_69_arg_1 = var_26; [L237] SORT_3 var_69 = var_69_arg_0 != var_69_arg_1; [L238] SORT_3 var_70_arg_0 = var_68; [L239] SORT_3 var_70_arg_1 = var_69; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_70_arg_0=0, var_70_arg_1=0, var_72=3, var_91=0] [L240] EXPR var_70_arg_0 & var_70_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L240] SORT_3 var_70 = var_70_arg_0 & var_70_arg_1; [L241] EXPR var_70 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_22=31, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_36=0, var_37=1, var_55=2, var_72=3, var_91=0] [L241] var_70 = var_70 & mask_SORT_3 [L242] SORT_3 var_38_arg_0 = var_36; [L243] SORT_3 var_38_arg_1 = var_37; [L244] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L245] SORT_1 var_41_arg_0 = state_22; [L246] SORT_1 var_41_arg_1 = state_39; [L247] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L248] SORT_3 var_42_arg_0 = var_38; [L249] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_42_arg_0=0, var_42_arg_1=0, var_55=2, var_70=0, var_72=3, var_91=0] [L250] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L250] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L251] SORT_3 var_46_arg_0 = state_44; [L252] SORT_3 var_46_arg_1 = var_37; [L253] SORT_3 var_46 = var_46_arg_0 == var_46_arg_1; [L254] SORT_3 var_47_arg_0 = var_42; [L255] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_47_arg_0=0, var_47_arg_1=0, var_55=2, var_70=0, var_72=3, var_91=0] [L256] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L256] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L257] SORT_3 var_50_arg_0 = state_48; [L258] SORT_3 var_50_arg_1 = var_37; [L259] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L260] SORT_3 var_51_arg_0 = var_47; [L261] SORT_3 var_51_arg_1 = var_50; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_51_arg_0=0, var_51_arg_1=0, var_55=2, var_70=0, var_72=3, var_91=0] [L262] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_25=31, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L262] SORT_3 var_51 = var_51_arg_0 & var_51_arg_1; [L263] SORT_24 var_52_arg_0 = var_25; [L264] SORT_24 var_52_arg_1 = var_26; [L265] SORT_3 var_52 = var_52_arg_0 != var_52_arg_1; [L266] SORT_3 var_53_arg_0 = var_51; [L267] SORT_3 var_53_arg_1 = var_52; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_53_arg_0=0, var_53_arg_1=0, var_55=2, var_70=0, var_72=3, var_91=0] [L268] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L268] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L269] EXPR var_53 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_70=0, var_72=3, var_91=0] [L269] var_53 = var_53 & mask_SORT_3 [L270] SORT_3 var_54_arg_0 = var_53; [L271] SORT_33 var_54_arg_1 = var_35; [L272] SORT_33 var_54_arg_2 = var_34; [L273] SORT_33 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L274] SORT_3 var_71_arg_0 = var_70; [L275] SORT_33 var_71_arg_1 = var_55; [L276] SORT_33 var_71_arg_2 = var_54; [L277] SORT_33 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L278] SORT_3 var_92_arg_0 = var_91; [L279] SORT_33 var_92_arg_1 = var_72; [L280] SORT_33 var_92_arg_2 = var_71; [L281] SORT_33 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0] [L282] EXPR var_92 & mask_SORT_33 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L282] var_92 = var_92 & mask_SORT_33 [L283] SORT_33 var_99_arg_0 = var_92; [L284] SORT_33 var_99_arg_1 = var_35; [L285] SORT_3 var_99 = var_99_arg_0 == var_99_arg_1; [L286] SORT_33 var_97_arg_0 = var_92; [L287] SORT_33 var_97_arg_1 = var_34; [L288] SORT_3 var_97 = var_97_arg_0 == var_97_arg_1; [L289] SORT_3 var_100_arg_0 = var_99; [L290] SORT_3 var_100_arg_1 = var_97; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_100_arg_0=0, var_100_arg_1=1, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0, var_97=1] [L291] EXPR var_100_arg_0 | var_100_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0, var_97=1] [L291] SORT_3 var_100 = var_100_arg_0 | var_100_arg_1; [L292] EXPR var_100 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_29=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_102=1, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3, var_92=0, var_97=1] [L292] var_100 = var_100 & mask_SORT_3 [L293] SORT_3 var_98_arg_0 = var_97; [L294] SORT_6 var_98_arg_1 = var_28; [L295] SORT_6 var_98_arg_2 = state_95; [L296] SORT_6 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L297] SORT_33 var_93_arg_0 = var_92; [L298] SORT_33 var_93_arg_1 = var_55; [L299] SORT_3 var_93 = var_93_arg_0 == var_93_arg_1; [L300] SORT_3 var_94_arg_0 = var_93; [L301] SORT_6 var_94_arg_1 = state_31; [L302] SORT_6 var_94_arg_2 = state_29; [L303] SORT_6 var_94 = var_94_arg_0 ? var_94_arg_1 : var_94_arg_2; [L304] SORT_3 var_101_arg_0 = var_100; [L305] SORT_6 var_101_arg_1 = var_98; [L306] SORT_6 var_101_arg_2 = var_94; [L307] SORT_6 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L308] SORT_3 var_103_arg_0 = var_102; [L309] SORT_6 var_103_arg_1 = var_28; [L310] SORT_6 var_103_arg_2 = var_101; [L311] SORT_6 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L312] SORT_6 var_104_arg_0 = var_103; [L313] SORT_1 var_104 = var_104_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_104=0, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L314] EXPR var_104 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_27=1, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L314] var_104 = var_104 & mask_SORT_1 [L315] SORT_1 var_105_arg_0 = var_104; [L316] SORT_1 var_105_arg_1 = var_21; [L317] SORT_3 var_105 = var_105_arg_0 == var_105_arg_1; [L318] SORT_3 var_106_arg_0 = var_27; [L319] SORT_3 var_106_arg_1 = var_105; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_106_arg_0=1, var_106_arg_1=1, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L320] EXPR var_106_arg_0 & var_106_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L320] SORT_3 var_106 = var_106_arg_0 & var_106_arg_1; [L321] SORT_3 var_107_arg_0 = var_106; [L322] SORT_3 var_107 = ~var_107_arg_0; [L323] SORT_3 var_110_arg_0 = var_107; [L324] SORT_3 var_110 = ~var_110_arg_0; [L325] SORT_3 var_111_arg_0 = var_37; [L326] SORT_3 var_111_arg_1 = var_110; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_111_arg_0=1, var_111_arg_1=-255, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L327] EXPR var_111_arg_0 & var_111_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L327] SORT_3 var_111 = var_111_arg_0 & var_111_arg_1; [L328] EXPR var_111 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=2147483649, state_115=0, state_119=0, state_31=0, state_39=0, state_48=0, state_57=0, state_61=0, state_78=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L328] var_111 = var_111 & mask_SORT_3 [L329] SORT_3 bad_112_arg_0 = var_111; [L330] CALL __VERIFIER_assert(!(bad_112_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5499 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5499 mSDsluCounter, 18905 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15863 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6693 IncrementalHoareTripleChecker+Invalid, 6707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 3042 mSDtfsCounter, 6693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1067 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred in iteration=9, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 969 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2038 NumberOfCodeBlocks, 2038 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2216 ConstructedInterpolants, 0 QuantifiedInterpolants, 10153 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3784 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 402/576 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:11:38,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7f92922ffa71366d540d70f941bc1459bfdc5c51893e6ae68b25745b7371220 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:11:40,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:11:41,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:11:41,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:11:41,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:11:41,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:11:41,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:11:41,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:11:41,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:11:41,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:11:41,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:11:41,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:11:41,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:11:41,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:11:41,060 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:11:41,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:11:41,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:11:41,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:11:41,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:11:41,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:11:41,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:41,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:11:41,063 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:11:41,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:11:41,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:11:41,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:11:41,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:11:41,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:11:41,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b7f92922ffa71366d540d70f941bc1459bfdc5c51893e6ae68b25745b7371220 [2025-02-08 00:11:41,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:11:41,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:11:41,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:11:41,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:11:41,340 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:11:41,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c [2025-02-08 00:11:42,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6862baf/17261694e72e4f5ebc23a1f7cfe27232/FLAGc82cb0f24 [2025-02-08 00:11:42,946 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:11:42,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c [2025-02-08 00:11:42,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6862baf/17261694e72e4f5ebc23a1f7cfe27232/FLAGc82cb0f24 [2025-02-08 00:11:42,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6862baf/17261694e72e4f5ebc23a1f7cfe27232 [2025-02-08 00:11:42,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:11:42,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:11:42,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:42,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:11:42,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:11:42,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7137a60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42, skipping insertion in model container [2025-02-08 00:11:42,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:43,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:11:43,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c[1258,1271] [2025-02-08 00:11:43,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:43,197 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:11:43,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p1.c[1258,1271] [2025-02-08 00:11:43,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:43,261 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:11:43,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43 WrapperNode [2025-02-08 00:11:43,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:43,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:43,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:11:43,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:11:43,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,320 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 462 [2025-02-08 00:11:43,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:43,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:11:43,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:11:43,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:11:43,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,373 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]. [2025-02-08 00:11:43,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:11:43,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:11:43,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:11:43,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:11:43,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (1/1) ... [2025-02-08 00:11:43,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:43,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:11:43,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:11:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:11:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:11:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:11:43,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:11:43,615 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:11:43,617 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:11:44,035 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2025-02-08 00:11:44,037 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:11:44,044 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:11:44,044 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:11:44,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:44 BoogieIcfgContainer [2025-02-08 00:11:44,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:11:44,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:11:44,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:11:44,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:11:44,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:11:42" (1/3) ... [2025-02-08 00:11:44,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3348736e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:44, skipping insertion in model container [2025-02-08 00:11:44,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:43" (2/3) ... [2025-02-08 00:11:44,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3348736e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:44, skipping insertion in model container [2025-02-08 00:11:44,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:44" (3/3) ... [2025-02-08 00:11:44,057 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p1.c [2025-02-08 00:11:44,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:11:44,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_fru32_p1.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:11:44,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:11:44,148 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;@340fa5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:11:44,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:11:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) [2025-02-08 00:11:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:11:44,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:44,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:11:44,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:44,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:11:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:11:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118586223] [2025-02-08 00:11:44,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:44,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:11:44,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:11:44,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:11:44,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:11:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:44,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 00:11:44,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:44,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:11:44,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:11:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118586223] [2025-02-08 00:11:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118586223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:44,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:44,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:11:44,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004460517] [2025-02-08 00:11:44,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:44,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:44,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:11:44,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:44,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:44,675 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-02-08 00:11:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:44,722 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-08 00:11:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 00:11:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:44,732 INFO L225 Difference]: With dead ends: 15 [2025-02-08 00:11:44,733 INFO L226 Difference]: Without dead ends: 8 [2025-02-08 00:11:44,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:44,740 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 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 [2025-02-08 00:11:44,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:11:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-08 00:11:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 00:11:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:11:44,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:11:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:44,774 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:11:44,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-02-08 00:11:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:11:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:11:44,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:44,774 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:11:44,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:11:44,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:44,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:11:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:11:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941788722] [2025-02-08 00:11:44,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:44,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:11:44,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:11:45,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:11:45,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:11:45,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:45,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:45,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:11:45,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:11:45,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:11:45,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:45,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:45,390 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 00:11:45,391 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:11:45,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:11:45,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:11:45,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:45,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:11:45,620 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:45,621 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:45,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:11:45,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:11:45 BoogieIcfgContainer [2025-02-08 00:11:45,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:11:45,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:11:45,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:11:45,645 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:11:45,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:44" (3/4) ... [2025-02-08 00:11:45,646 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 00:11:45,657 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:45,659 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:45,759 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-02-08 00:11:45,793 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:11:45,794 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:11:45,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:11:45,794 INFO L158 Benchmark]: Toolchain (without parser) took 2818.71ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 99.9MB in the end (delta: 15.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-02-08 00:11:45,795 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:11:45,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.41ms. Allocated memory is still 142.6MB. Free memory was 114.8MB in the beginning and 95.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:11:45,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.98ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:45,795 INFO L158 Benchmark]: Boogie Preprocessor took 81.35ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:11:45,795 INFO L158 Benchmark]: IcfgBuilder took 642.12ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 46.1MB in the end (delta: 42.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:11:45,796 INFO L158 Benchmark]: TraceAbstraction took 1597.22ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 38.1MB in the end (delta: 7.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2025-02-08 00:11:45,796 INFO L158 Benchmark]: Witness Printer took 149.33ms. Allocated memory is still 142.6MB. Free memory was 38.1MB in the beginning and 99.9MB in the end (delta: -61.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2025-02-08 00:11:45,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.41ms. Allocated memory is still 142.6MB. Free memory was 114.8MB in the beginning and 95.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.98ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.35ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 642.12ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 46.1MB in the end (delta: 42.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1597.22ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 38.1MB in the end (delta: 7.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 149.33ms. Allocated memory is still 142.6MB. Free memory was 38.1MB in the beginning and 99.9MB in the end (delta: -61.9MB). Peak memory consumption was 9.1MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 5); [L36] const SORT_24 msb_SORT_24 = (SORT_24)1 << (5 - 1); [L38] const SORT_33 mask_SORT_33 = (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 2); [L39] const SORT_33 msb_SORT_33 = (SORT_33)1 << (2 - 1); [L41] const SORT_1 var_21 = 0; [L42] const SORT_24 var_26 = 31; [L43] const SORT_6 var_28 = 0; [L44] const SORT_33 var_34 = 0; [L45] const SORT_33 var_35 = 1; [L46] const SORT_3 var_37 = 1; [L47] const SORT_3 var_43 = 0; [L48] const SORT_33 var_55 = 2; [L49] const SORT_33 var_72 = 3; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_117; [L69] SORT_3 input_121; [L70] SORT_1 input_123; [L71] SORT_3 input_125; [L72] SORT_33 input_128; [L73] SORT_3 input_130; [L74] SORT_6 input_133; [L75] SORT_3 input_135; [L77] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_6 state_29 = __VERIFIER_nondet_uint() & mask_SORT_6; [L79] SORT_6 state_31 = __VERIFIER_nondet_uint() & mask_SORT_6; [L80] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L82] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] SORT_3 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] SORT_3 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] SORT_3 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] SORT_6 state_95 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] SORT_1 state_113 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_119 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_23_arg_1 = var_21; [L96] state_22 = init_23_arg_1 [L97] SORT_6 init_30_arg_1 = var_28; [L98] state_29 = init_30_arg_1 [L99] SORT_6 init_32_arg_1 = var_28; [L100] state_31 = init_32_arg_1 [L101] SORT_1 init_40_arg_1 = var_21; [L102] state_39 = init_40_arg_1 [L103] SORT_3 init_45_arg_1 = var_43; [L104] state_44 = init_45_arg_1 [L105] SORT_3 init_49_arg_1 = var_43; [L106] state_48 = init_49_arg_1 [L107] SORT_1 init_58_arg_1 = var_21; [L108] state_57 = init_58_arg_1 [L109] SORT_3 init_62_arg_1 = var_43; [L110] state_61 = init_62_arg_1 [L111] SORT_3 init_66_arg_1 = var_43; [L112] state_65 = init_66_arg_1 [L113] SORT_1 init_75_arg_1 = var_21; [L114] state_74 = init_75_arg_1 [L115] SORT_3 init_79_arg_1 = var_43; [L116] state_78 = init_79_arg_1 [L117] SORT_3 init_83_arg_1 = var_43; [L118] state_82 = init_83_arg_1 [L119] SORT_3 init_87_arg_1 = var_43; [L120] state_86 = init_87_arg_1 [L121] SORT_6 init_96_arg_1 = var_28; [L122] state_95 = init_96_arg_1 [L123] SORT_1 init_114_arg_1 = var_21; [L124] state_113 = init_114_arg_1 [L125] SORT_3 init_116_arg_1 = var_43; [L126] state_115 = init_116_arg_1 [L127] SORT_3 init_120_arg_1 = var_43; [L128] state_119 = init_120_arg_1 VAL [mask_SORT_1=63, mask_SORT_24=31, mask_SORT_33=3, mask_SORT_3=1, state_113=0, state_115=0, state_119=0, state_22=0, state_29=0, state_31=0, state_39=0, state_44=0, state_48=0, state_57=0, state_61=0, state_65=0, state_74=0, state_78=0, state_82=0, state_86=0, state_95=0, var_21=0, var_26=31, var_28=0, var_34=0, var_35=1, var_37=1, var_55=2, var_72=3] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_117 = __VERIFIER_nondet_uchar() [L159] input_121 = __VERIFIER_nondet_uchar() [L160] input_123 = __VERIFIER_nondet_uchar() [L161] input_125 = __VERIFIER_nondet_uchar() [L162] input_128 = __VERIFIER_nondet_uchar() [L163] input_130 = __VERIFIER_nondet_uchar() [L164] input_133 = __VERIFIER_nondet_uint() [L165] input_135 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_25_arg_0 = state_22; [L169] SORT_24 var_25 = var_25_arg_0 >> 0; [L170] var_25 = var_25 & mask_SORT_24 [L171] SORT_24 var_27_arg_0 = var_25; [L172] SORT_24 var_27_arg_1 = var_26; [L173] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_24 var_102_arg_0 = var_25; [L175] SORT_24 var_102_arg_1 = var_26; [L176] SORT_3 var_102 = var_102_arg_0 == var_102_arg_1; [L177] SORT_1 var_36_arg_0 = state_22; [L178] SORT_3 var_36 = var_36_arg_0 >> 5; [L179] var_36 = var_36 & mask_SORT_3 [L180] SORT_3 var_73_arg_0 = var_36; [L181] SORT_3 var_73_arg_1 = var_37; [L182] SORT_3 var_73 = var_73_arg_0 == var_73_arg_1; [L183] SORT_1 var_76_arg_0 = state_22; [L184] SORT_1 var_76_arg_1 = state_74; [L185] SORT_3 var_76 = var_76_arg_0 == var_76_arg_1; [L186] SORT_3 var_77_arg_0 = var_73; [L187] SORT_3 var_77_arg_1 = var_76; [L188] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L189] SORT_3 var_80_arg_0 = state_78; [L190] SORT_3 var_80_arg_1 = var_37; [L191] SORT_3 var_80 = var_80_arg_0 != var_80_arg_1; [L192] SORT_3 var_81_arg_0 = var_77; [L193] SORT_3 var_81_arg_1 = var_80; [L194] SORT_3 var_81 = var_81_arg_0 & var_81_arg_1; [L195] SORT_3 var_84_arg_0 = state_82; [L196] SORT_3 var_84_arg_1 = var_37; [L197] SORT_3 var_84 = var_84_arg_0 == var_84_arg_1; [L198] SORT_3 var_85_arg_0 = var_81; [L199] SORT_3 var_85_arg_1 = var_84; [L200] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L201] SORT_3 var_88_arg_0 = state_86; [L202] SORT_3 var_88_arg_1 = var_37; [L203] SORT_3 var_88 = var_88_arg_0 == var_88_arg_1; [L204] SORT_3 var_89_arg_0 = var_85; [L205] SORT_3 var_89_arg_1 = var_88; [L206] SORT_3 var_89 = var_89_arg_0 & var_89_arg_1; [L207] SORT_24 var_90_arg_0 = var_25; [L208] SORT_24 var_90_arg_1 = var_26; [L209] SORT_3 var_90 = var_90_arg_0 != var_90_arg_1; [L210] SORT_3 var_91_arg_0 = var_89; [L211] SORT_3 var_91_arg_1 = var_90; [L212] SORT_3 var_91 = var_91_arg_0 & var_91_arg_1; [L213] var_91 = var_91 & mask_SORT_3 [L214] SORT_3 var_56_arg_0 = var_36; [L215] SORT_3 var_56_arg_1 = var_37; [L216] SORT_3 var_56 = var_56_arg_0 == var_56_arg_1; [L217] SORT_1 var_59_arg_0 = state_22; [L218] SORT_1 var_59_arg_1 = state_57; [L219] SORT_3 var_59 = var_59_arg_0 == var_59_arg_1; [L220] SORT_3 var_60_arg_0 = var_56; [L221] SORT_3 var_60_arg_1 = var_59; [L222] SORT_3 var_60 = var_60_arg_0 & var_60_arg_1; [L223] SORT_3 var_63_arg_0 = state_61; [L224] SORT_3 var_63_arg_1 = var_37; [L225] SORT_3 var_63 = var_63_arg_0 == var_63_arg_1; [L226] SORT_3 var_64_arg_0 = var_60; [L227] SORT_3 var_64_arg_1 = var_63; [L228] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L229] SORT_3 var_67_arg_0 = state_65; [L230] SORT_3 var_67_arg_1 = var_37; [L231] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L232] SORT_3 var_68_arg_0 = var_64; [L233] SORT_3 var_68_arg_1 = var_67; [L234] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L235] SORT_24 var_69_arg_0 = var_25; [L236] SORT_24 var_69_arg_1 = var_26; [L237] SORT_3 var_69 = var_69_arg_0 != var_69_arg_1; [L238] SORT_3 var_70_arg_0 = var_68; [L239] SORT_3 var_70_arg_1 = var_69; [L240] SORT_3 var_70 = var_70_arg_0 & var_70_arg_1; [L241] var_70 = var_70 & mask_SORT_3 [L242] SORT_3 var_38_arg_0 = var_36; [L243] SORT_3 var_38_arg_1 = var_37; [L244] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L245] SORT_1 var_41_arg_0 = state_22; [L246] SORT_1 var_41_arg_1 = state_39; [L247] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L248] SORT_3 var_42_arg_0 = var_38; [L249] SORT_3 var_42_arg_1 = var_41; [L250] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L251] SORT_3 var_46_arg_0 = state_44; [L252] SORT_3 var_46_arg_1 = var_37; [L253] SORT_3 var_46 = var_46_arg_0 == var_46_arg_1; [L254] SORT_3 var_47_arg_0 = var_42; [L255] SORT_3 var_47_arg_1 = var_46; [L256] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L257] SORT_3 var_50_arg_0 = state_48; [L258] SORT_3 var_50_arg_1 = var_37; [L259] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L260] SORT_3 var_51_arg_0 = var_47; [L261] SORT_3 var_51_arg_1 = var_50; [L262] SORT_3 var_51 = var_51_arg_0 & var_51_arg_1; [L263] SORT_24 var_52_arg_0 = var_25; [L264] SORT_24 var_52_arg_1 = var_26; [L265] SORT_3 var_52 = var_52_arg_0 != var_52_arg_1; [L266] SORT_3 var_53_arg_0 = var_51; [L267] SORT_3 var_53_arg_1 = var_52; [L268] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L269] var_53 = var_53 & mask_SORT_3 [L270] SORT_3 var_54_arg_0 = var_53; [L271] SORT_33 var_54_arg_1 = var_35; [L272] SORT_33 var_54_arg_2 = var_34; [L273] SORT_33 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L274] SORT_3 var_71_arg_0 = var_70; [L275] SORT_33 var_71_arg_1 = var_55; [L276] SORT_33 var_71_arg_2 = var_54; [L277] SORT_33 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L278] SORT_3 var_92_arg_0 = var_91; [L279] SORT_33 var_92_arg_1 = var_72; [L280] SORT_33 var_92_arg_2 = var_71; [L281] SORT_33 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L282] var_92 = var_92 & mask_SORT_33 [L283] SORT_33 var_99_arg_0 = var_92; [L284] SORT_33 var_99_arg_1 = var_35; [L285] SORT_3 var_99 = var_99_arg_0 == var_99_arg_1; [L286] SORT_33 var_97_arg_0 = var_92; [L287] SORT_33 var_97_arg_1 = var_34; [L288] SORT_3 var_97 = var_97_arg_0 == var_97_arg_1; [L289] SORT_3 var_100_arg_0 = var_99; [L290] SORT_3 var_100_arg_1 = var_97; [L291] SORT_3 var_100 = var_100_arg_0 | var_100_arg_1; [L292] var_100 = var_100 & mask_SORT_3 [L293] SORT_3 var_98_arg_0 = var_97; [L294] SORT_6 var_98_arg_1 = var_28; [L295] SORT_6 var_98_arg_2 = state_95; [L296] SORT_6 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L297] SORT_33 var_93_arg_0 = var_92; [L298] SORT_33 var_93_arg_1 = var_55; [L299] SORT_3 var_93 = var_93_arg_0 == var_93_arg_1; [L300] SORT_3 var_94_arg_0 = var_93; [L301] SORT_6 var_94_arg_1 = state_31; [L302] SORT_6 var_94_arg_2 = state_29; [L303] SORT_6 var_94 = var_94_arg_0 ? var_94_arg_1 : var_94_arg_2; [L304] SORT_3 var_101_arg_0 = var_100; [L305] SORT_6 var_101_arg_1 = var_98; [L306] SORT_6 var_101_arg_2 = var_94; [L307] SORT_6 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L308] SORT_3 var_103_arg_0 = var_102; [L309] SORT_6 var_103_arg_1 = var_28; [L310] SORT_6 var_103_arg_2 = var_101; [L311] SORT_6 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L312] SORT_6 var_104_arg_0 = var_103; [L313] SORT_1 var_104 = var_104_arg_0 >> 26; [L314] var_104 = var_104 & mask_SORT_1 [L315] SORT_1 var_105_arg_0 = var_104; [L316] SORT_1 var_105_arg_1 = var_21; [L317] SORT_3 var_105 = var_105_arg_0 == var_105_arg_1; [L318] SORT_3 var_106_arg_0 = var_27; [L319] SORT_3 var_106_arg_1 = var_105; [L320] SORT_3 var_106 = var_106_arg_0 & var_106_arg_1; [L321] SORT_3 var_107_arg_0 = var_106; [L322] SORT_3 var_107 = ~var_107_arg_0; [L323] SORT_3 var_110_arg_0 = var_107; [L324] SORT_3 var_110 = ~var_110_arg_0; [L325] SORT_3 var_111_arg_0 = var_37; [L326] SORT_3 var_111_arg_1 = var_110; [L327] SORT_3 var_111 = var_111_arg_0 & var_111_arg_1; [L328] var_111 = var_111 & mask_SORT_3 [L329] SORT_3 bad_112_arg_0 = var_111; [L330] CALL __VERIFIER_assert(!(bad_112_arg_0)) [L21] COND FALSE !(!(cond)) [L330] RET __VERIFIER_assert(!(bad_112_arg_0)) [L332] SORT_1 next_138_arg_1 = input_11; [L333] SORT_6 next_139_arg_1 = input_7; [L334] SORT_6 next_140_arg_1 = input_9; [L335] SORT_3 var_141_arg_0 = state_119; [L336] SORT_1 var_141_arg_1 = state_57; [L337] SORT_1 var_141_arg_2 = state_39; [L338] SORT_1 var_141 = var_141_arg_0 ? var_141_arg_1 : var_141_arg_2; [L339] var_141 = var_141 & mask_SORT_1 [L340] SORT_1 next_142_arg_1 = var_141; [L341] SORT_3 next_143_arg_1 = input_19; [L342] SORT_3 var_144_arg_0 = state_119; [L343] SORT_3 var_144_arg_1 = state_61; [L344] SORT_3 var_144_arg_2 = state_48; [L345] SORT_3 var_144 = var_144_arg_0 ? var_144_arg_1 : var_144_arg_2; [L346] var_144 = var_144 & mask_SORT_3 [L347] SORT_3 next_145_arg_1 = var_144; [L348] SORT_1 next_146_arg_1 = input_10; [L349] SORT_3 next_147_arg_1 = input_8; [L350] SORT_3 next_148_arg_1 = input_18; [L351] SORT_1 next_149_arg_1 = input_5; [L352] SORT_1 var_150_arg_0 = state_113; [L353] SORT_3 var_150 = var_150_arg_0 >> 5; [L354] SORT_1 var_151_arg_0 = state_113; [L355] SORT_3 var_151 = var_151_arg_0 >> 2; [L356] SORT_3 var_152_arg_0 = var_150; [L357] SORT_3 var_152_arg_1 = var_151; [L358] SORT_3 var_152 = var_152_arg_0 & var_152_arg_1; [L359] SORT_1 var_153_arg_0 = state_113; [L360] SORT_3 var_153 = var_153_arg_0 >> 0; [L361] SORT_3 var_154_arg_0 = var_153; [L362] SORT_3 var_154 = ~var_154_arg_0; [L363] SORT_3 var_155_arg_0 = var_152; [L364] SORT_3 var_155_arg_1 = var_154; [L365] SORT_3 var_155 = var_155_arg_0 & var_155_arg_1; [L366] SORT_3 var_156_arg_0 = state_115; [L367] SORT_3 var_156_arg_1 = var_155; [L368] SORT_3 var_156_arg_2 = state_78; [L369] SORT_3 var_156 = var_156_arg_0 ? var_156_arg_1 : var_156_arg_2; [L370] var_156 = var_156 & mask_SORT_3 [L371] SORT_3 next_157_arg_1 = var_156; [L372] SORT_3 next_158_arg_1 = input_4; [L373] SORT_3 next_159_arg_1 = input_17; [L374] SORT_3 var_160_arg_0 = state_119; [L375] SORT_6 var_160_arg_1 = state_31; [L376] SORT_6 var_160_arg_2 = state_95; [L377] SORT_6 var_160 = var_160_arg_0 ? var_160_arg_1 : var_160_arg_2; [L378] SORT_6 next_161_arg_1 = var_160; [L379] SORT_1 next_162_arg_1 = input_2; [L380] SORT_3 next_163_arg_1 = input_14; [L381] SORT_3 next_164_arg_1 = input_16; [L383] state_22 = next_138_arg_1 [L384] state_29 = next_139_arg_1 [L385] state_31 = next_140_arg_1 [L386] state_39 = next_142_arg_1 [L387] state_44 = next_143_arg_1 [L388] state_48 = next_145_arg_1 [L389] state_57 = next_146_arg_1 [L390] state_61 = next_147_arg_1 [L391] state_65 = next_148_arg_1 [L392] state_74 = next_149_arg_1 [L393] state_78 = next_157_arg_1 [L394] state_82 = next_158_arg_1 [L395] state_86 = next_159_arg_1 [L396] state_95 = next_161_arg_1 [L397] state_113 = next_162_arg_1 [L398] state_115 = next_163_arg_1 [L399] state_119 = next_164_arg_1 [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_117 = __VERIFIER_nondet_uchar() [L159] input_121 = __VERIFIER_nondet_uchar() [L160] input_123 = __VERIFIER_nondet_uchar() [L161] input_125 = __VERIFIER_nondet_uchar() [L162] input_128 = __VERIFIER_nondet_uchar() [L163] input_130 = __VERIFIER_nondet_uchar() [L164] input_133 = __VERIFIER_nondet_uint() [L165] input_135 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_25_arg_0 = state_22; [L169] SORT_24 var_25 = var_25_arg_0 >> 0; [L170] var_25 = var_25 & mask_SORT_24 [L171] SORT_24 var_27_arg_0 = var_25; [L172] SORT_24 var_27_arg_1 = var_26; [L173] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_24 var_102_arg_0 = var_25; [L175] SORT_24 var_102_arg_1 = var_26; [L176] SORT_3 var_102 = var_102_arg_0 == var_102_arg_1; [L177] SORT_1 var_36_arg_0 = state_22; [L178] SORT_3 var_36 = var_36_arg_0 >> 5; [L179] var_36 = var_36 & mask_SORT_3 [L180] SORT_3 var_73_arg_0 = var_36; [L181] SORT_3 var_73_arg_1 = var_37; [L182] SORT_3 var_73 = var_73_arg_0 == var_73_arg_1; [L183] SORT_1 var_76_arg_0 = state_22; [L184] SORT_1 var_76_arg_1 = state_74; [L185] SORT_3 var_76 = var_76_arg_0 == var_76_arg_1; [L186] SORT_3 var_77_arg_0 = var_73; [L187] SORT_3 var_77_arg_1 = var_76; [L188] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L189] SORT_3 var_80_arg_0 = state_78; [L190] SORT_3 var_80_arg_1 = var_37; [L191] SORT_3 var_80 = var_80_arg_0 != var_80_arg_1; [L192] SORT_3 var_81_arg_0 = var_77; [L193] SORT_3 var_81_arg_1 = var_80; [L194] SORT_3 var_81 = var_81_arg_0 & var_81_arg_1; [L195] SORT_3 var_84_arg_0 = state_82; [L196] SORT_3 var_84_arg_1 = var_37; [L197] SORT_3 var_84 = var_84_arg_0 == var_84_arg_1; [L198] SORT_3 var_85_arg_0 = var_81; [L199] SORT_3 var_85_arg_1 = var_84; [L200] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L201] SORT_3 var_88_arg_0 = state_86; [L202] SORT_3 var_88_arg_1 = var_37; [L203] SORT_3 var_88 = var_88_arg_0 == var_88_arg_1; [L204] SORT_3 var_89_arg_0 = var_85; [L205] SORT_3 var_89_arg_1 = var_88; [L206] SORT_3 var_89 = var_89_arg_0 & var_89_arg_1; [L207] SORT_24 var_90_arg_0 = var_25; [L208] SORT_24 var_90_arg_1 = var_26; [L209] SORT_3 var_90 = var_90_arg_0 != var_90_arg_1; [L210] SORT_3 var_91_arg_0 = var_89; [L211] SORT_3 var_91_arg_1 = var_90; [L212] SORT_3 var_91 = var_91_arg_0 & var_91_arg_1; [L213] var_91 = var_91 & mask_SORT_3 [L214] SORT_3 var_56_arg_0 = var_36; [L215] SORT_3 var_56_arg_1 = var_37; [L216] SORT_3 var_56 = var_56_arg_0 == var_56_arg_1; [L217] SORT_1 var_59_arg_0 = state_22; [L218] SORT_1 var_59_arg_1 = state_57; [L219] SORT_3 var_59 = var_59_arg_0 == var_59_arg_1; [L220] SORT_3 var_60_arg_0 = var_56; [L221] SORT_3 var_60_arg_1 = var_59; [L222] SORT_3 var_60 = var_60_arg_0 & var_60_arg_1; [L223] SORT_3 var_63_arg_0 = state_61; [L224] SORT_3 var_63_arg_1 = var_37; [L225] SORT_3 var_63 = var_63_arg_0 == var_63_arg_1; [L226] SORT_3 var_64_arg_0 = var_60; [L227] SORT_3 var_64_arg_1 = var_63; [L228] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L229] SORT_3 var_67_arg_0 = state_65; [L230] SORT_3 var_67_arg_1 = var_37; [L231] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L232] SORT_3 var_68_arg_0 = var_64; [L233] SORT_3 var_68_arg_1 = var_67; [L234] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L235] SORT_24 var_69_arg_0 = var_25; [L236] SORT_24 var_69_arg_1 = var_26; [L237] SORT_3 var_69 = var_69_arg_0 != var_69_arg_1; [L238] SORT_3 var_70_arg_0 = var_68; [L239] SORT_3 var_70_arg_1 = var_69; [L240] SORT_3 var_70 = var_70_arg_0 & var_70_arg_1; [L241] var_70 = var_70 & mask_SORT_3 [L242] SORT_3 var_38_arg_0 = var_36; [L243] SORT_3 var_38_arg_1 = var_37; [L244] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L245] SORT_1 var_41_arg_0 = state_22; [L246] SORT_1 var_41_arg_1 = state_39; [L247] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L248] SORT_3 var_42_arg_0 = var_38; [L249] SORT_3 var_42_arg_1 = var_41; [L250] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L251] SORT_3 var_46_arg_0 = state_44; [L252] SORT_3 var_46_arg_1 = var_37; [L253] SORT_3 var_46 = var_46_arg_0 == var_46_arg_1; [L254] SORT_3 var_47_arg_0 = var_42; [L255] SORT_3 var_47_arg_1 = var_46; [L256] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L257] SORT_3 var_50_arg_0 = state_48; [L258] SORT_3 var_50_arg_1 = var_37; [L259] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L260] SORT_3 var_51_arg_0 = var_47; [L261] SORT_3 var_51_arg_1 = var_50; [L262] SORT_3 var_51 = var_51_arg_0 & var_51_arg_1; [L263] SORT_24 var_52_arg_0 = var_25; [L264] SORT_24 var_52_arg_1 = var_26; [L265] SORT_3 var_52 = var_52_arg_0 != var_52_arg_1; [L266] SORT_3 var_53_arg_0 = var_51; [L267] SORT_3 var_53_arg_1 = var_52; [L268] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L269] var_53 = var_53 & mask_SORT_3 [L270] SORT_3 var_54_arg_0 = var_53; [L271] SORT_33 var_54_arg_1 = var_35; [L272] SORT_33 var_54_arg_2 = var_34; [L273] SORT_33 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L274] SORT_3 var_71_arg_0 = var_70; [L275] SORT_33 var_71_arg_1 = var_55; [L276] SORT_33 var_71_arg_2 = var_54; [L277] SORT_33 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L278] SORT_3 var_92_arg_0 = var_91; [L279] SORT_33 var_92_arg_1 = var_72; [L280] SORT_33 var_92_arg_2 = var_71; [L281] SORT_33 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L282] var_92 = var_92 & mask_SORT_33 [L283] SORT_33 var_99_arg_0 = var_92; [L284] SORT_33 var_99_arg_1 = var_35; [L285] SORT_3 var_99 = var_99_arg_0 == var_99_arg_1; [L286] SORT_33 var_97_arg_0 = var_92; [L287] SORT_33 var_97_arg_1 = var_34; [L288] SORT_3 var_97 = var_97_arg_0 == var_97_arg_1; [L289] SORT_3 var_100_arg_0 = var_99; [L290] SORT_3 var_100_arg_1 = var_97; [L291] SORT_3 var_100 = var_100_arg_0 | var_100_arg_1; [L292] var_100 = var_100 & mask_SORT_3 [L293] SORT_3 var_98_arg_0 = var_97; [L294] SORT_6 var_98_arg_1 = var_28; [L295] SORT_6 var_98_arg_2 = state_95; [L296] SORT_6 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L297] SORT_33 var_93_arg_0 = var_92; [L298] SORT_33 var_93_arg_1 = var_55; [L299] SORT_3 var_93 = var_93_arg_0 == var_93_arg_1; [L300] SORT_3 var_94_arg_0 = var_93; [L301] SORT_6 var_94_arg_1 = state_31; [L302] SORT_6 var_94_arg_2 = state_29; [L303] SORT_6 var_94 = var_94_arg_0 ? var_94_arg_1 : var_94_arg_2; [L304] SORT_3 var_101_arg_0 = var_100; [L305] SORT_6 var_101_arg_1 = var_98; [L306] SORT_6 var_101_arg_2 = var_94; [L307] SORT_6 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L308] SORT_3 var_103_arg_0 = var_102; [L309] SORT_6 var_103_arg_1 = var_28; [L310] SORT_6 var_103_arg_2 = var_101; [L311] SORT_6 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L312] SORT_6 var_104_arg_0 = var_103; [L313] SORT_1 var_104 = var_104_arg_0 >> 26; [L314] var_104 = var_104 & mask_SORT_1 [L315] SORT_1 var_105_arg_0 = var_104; [L316] SORT_1 var_105_arg_1 = var_21; [L317] SORT_3 var_105 = var_105_arg_0 == var_105_arg_1; [L318] SORT_3 var_106_arg_0 = var_27; [L319] SORT_3 var_106_arg_1 = var_105; [L320] SORT_3 var_106 = var_106_arg_0 & var_106_arg_1; [L321] SORT_3 var_107_arg_0 = var_106; [L322] SORT_3 var_107 = ~var_107_arg_0; [L323] SORT_3 var_110_arg_0 = var_107; [L324] SORT_3 var_110 = ~var_110_arg_0; [L325] SORT_3 var_111_arg_0 = var_37; [L326] SORT_3 var_111_arg_1 = var_110; [L327] SORT_3 var_111 = var_111_arg_0 & var_111_arg_1; [L328] var_111 = var_111 & mask_SORT_3 [L329] SORT_3 bad_112_arg_0 = var_111; [L330] CALL __VERIFIER_assert(!(bad_112_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 4 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 4 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 00:11:45,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE