./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 87137514c5ae1920d86e25d4c779abc7db4fd5f20bd8e328e0fe081c42450842 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:43:06,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:43:06,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:43:06,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:43:06,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:43:06,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:43:06,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:43:06,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:43:06,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:43:06,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:43:06,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:43:06,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:43:06,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:43:06,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:43:06,946 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:43:06,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:43:06,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:43:06,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:43:06,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:43:06,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:43:06,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:43:06,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:43:06,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:43:06,949 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/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 -> 87137514c5ae1920d86e25d4c779abc7db4fd5f20bd8e328e0fe081c42450842 [2025-03-03 16:43:07,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:43:07,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:43:07,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:43:07,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:43:07,217 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:43:07,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c [2025-03-03 16:43:08,427 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522d1e827/e157ef46091a4b35bf83fc51d46cde09/FLAGe2230f1e0 [2025-03-03 16:43:08,713 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:43:08,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c [2025-03-03 16:43:08,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522d1e827/e157ef46091a4b35bf83fc51d46cde09/FLAGe2230f1e0 [2025-03-03 16:43:08,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522d1e827/e157ef46091a4b35bf83fc51d46cde09 [2025-03-03 16:43:08,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:43:08,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:43:08,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:43:08,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:43:08,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:43:08,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:43:08" (1/1) ... [2025-03-03 16:43:08,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61afeb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:08, skipping insertion in model container [2025-03-03 16:43:08,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:43:08" (1/1) ... [2025-03-03 16:43:09,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:43:09,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c[1173,1186] [2025-03-03 16:43:09,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:43:09,509 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:43:09,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c[1173,1186] [2025-03-03 16:43:09,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:43:09,684 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:43:09,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09 WrapperNode [2025-03-03 16:43:09,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:43:09,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:43:09,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:43:09,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:43:09,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:09,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,305 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 6988 [2025-03-03 16:43:10,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:43:10,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:43:10,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:43:10,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:43:10,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,614 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-03-03 16:43:10,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:43:10,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:43:10,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:43:10,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:43:10,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (1/1) ... [2025-03-03 16:43:10,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:43:10,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:43:11,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:43:11,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:43:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:43:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:43:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:43:11,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:43:11,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:43:11,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:43:18,001 INFO L? ?]: Removed 3943 outVars from TransFormulas that were not future-live. [2025-03-03 16:43:18,002 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:43:18,173 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:43:18,173 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:43:18,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:43:18 BoogieIcfgContainer [2025-03-03 16:43:18,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:43:18,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:43:18,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:43:18,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:43:18,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:43:08" (1/3) ... [2025-03-03 16:43:18,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e49c57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:43:18, skipping insertion in model container [2025-03-03 16:43:18,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:09" (2/3) ... [2025-03-03 16:43:18,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e49c57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:43:18, skipping insertion in model container [2025-03-03 16:43:18,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:43:18" (3/3) ... [2025-03-03 16:43:18,180 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.7.prop1-func-interl.c [2025-03-03 16:43:18,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:43:18,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.7.prop1-func-interl.c that has 1 procedures, 2390 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:43:18,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:43:18,288 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;@3d90393b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:43:18,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:43:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 2390 states, 2388 states have (on average 1.4995812395309882) internal successors, (3581), 2389 states have internal predecessors, (3581), 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-03-03 16:43:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:43:18,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:18,310 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, 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-03-03 16:43:18,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:18,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1960773775, now seen corresponding path program 1 times [2025-03-03 16:43:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:18,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276656550] [2025-03-03 16:43:18,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:18,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:43:18,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:43:18,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:18,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276656550] [2025-03-03 16:43:19,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276656550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:19,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:19,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:43:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310780216] [2025-03-03 16:43:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:19,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:43:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:19,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:43:19,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:43:19,199 INFO L87 Difference]: Start difference. First operand has 2390 states, 2388 states have (on average 1.4995812395309882) internal successors, (3581), 2389 states have internal predecessors, (3581), 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 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-03-03 16:43:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:20,205 INFO L93 Difference]: Finished difference Result 4629 states and 6939 transitions. [2025-03-03 16:43:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:43:20,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 137 [2025-03-03 16:43:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:20,232 INFO L225 Difference]: With dead ends: 4629 [2025-03-03 16:43:20,232 INFO L226 Difference]: Without dead ends: 2389 [2025-03-03 16:43:20,242 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-03-03 16:43:20,246 INFO L435 NwaCegarLoop]: 2980 mSDtfsCounter, 0 mSDsluCounter, 5955 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8935 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:20,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8935 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:43:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-03-03 16:43:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2389. [2025-03-03 16:43:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2388 states have (on average 1.4987437185929648) internal successors, (3579), 2388 states have internal predecessors, (3579), 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-03-03 16:43:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3579 transitions. [2025-03-03 16:43:20,349 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3579 transitions. Word has length 137 [2025-03-03 16:43:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:20,350 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3579 transitions. [2025-03-03 16:43:20,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-03-03 16:43:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3579 transitions. [2025-03-03 16:43:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:43:20,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:20,358 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, 1, 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-03-03 16:43:20,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:43:20,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:20,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash -649762033, now seen corresponding path program 1 times [2025-03-03 16:43:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:20,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360132395] [2025-03-03 16:43:20,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:20,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:43:20,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:43:20,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:20,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360132395] [2025-03-03 16:43:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360132395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:43:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578875094] [2025-03-03 16:43:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:43:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:20,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:43:20,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:43:20,619 INFO L87 Difference]: Start difference. First operand 2389 states and 3579 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-03-03 16:43:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:21,537 INFO L93 Difference]: Finished difference Result 4630 states and 6937 transitions. [2025-03-03 16:43:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:43:21,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 138 [2025-03-03 16:43:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:21,546 INFO L225 Difference]: With dead ends: 4630 [2025-03-03 16:43:21,546 INFO L226 Difference]: Without dead ends: 2391 [2025-03-03 16:43:21,549 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-03-03 16:43:21,550 INFO L435 NwaCegarLoop]: 2980 mSDtfsCounter, 0 mSDsluCounter, 5952 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8932 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:21,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8932 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:43:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2025-03-03 16:43:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2025-03-03 16:43:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2390 states have (on average 1.498326359832636) internal successors, (3581), 2390 states have internal predecessors, (3581), 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-03-03 16:43:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3581 transitions. [2025-03-03 16:43:21,593 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3581 transitions. Word has length 138 [2025-03-03 16:43:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:21,594 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 3581 transitions. [2025-03-03 16:43:21,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-03-03 16:43:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3581 transitions. [2025-03-03 16:43:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 16:43:21,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:21,595 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, 1, 1, 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-03-03 16:43:21,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:43:21,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:21,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1031240916, now seen corresponding path program 1 times [2025-03-03 16:43:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138575880] [2025-03-03 16:43:21,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:21,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 16:43:21,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 16:43:21,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:21,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138575880] [2025-03-03 16:43:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138575880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:43:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148108682] [2025-03-03 16:43:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:21,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:43:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:21,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:43:21,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:43:21,853 INFO L87 Difference]: Start difference. First operand 2391 states and 3581 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-03-03 16:43:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:22,801 INFO L93 Difference]: Finished difference Result 4638 states and 6947 transitions. [2025-03-03 16:43:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:43:22,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 139 [2025-03-03 16:43:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:22,809 INFO L225 Difference]: With dead ends: 4638 [2025-03-03 16:43:22,809 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 16:43:22,811 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-03-03 16:43:22,811 INFO L435 NwaCegarLoop]: 2980 mSDtfsCounter, 4 mSDsluCounter, 5947 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8927 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:22,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8927 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:43:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 16:43:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2397. [2025-03-03 16:43:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2396 states have (on average 1.4979131886477461) internal successors, (3589), 2396 states have internal predecessors, (3589), 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-03-03 16:43:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3589 transitions. [2025-03-03 16:43:22,852 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3589 transitions. Word has length 139 [2025-03-03 16:43:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:22,853 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3589 transitions. [2025-03-03 16:43:22,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-03-03 16:43:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3589 transitions. [2025-03-03 16:43:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 16:43:22,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:22,854 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, 1, 1, 1, 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-03-03 16:43:22,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:43:22,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:22,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1470348729, now seen corresponding path program 1 times [2025-03-03 16:43:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087639082] [2025-03-03 16:43:22,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:22,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 16:43:22,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 16:43:22,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:22,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:23,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087639082] [2025-03-03 16:43:23,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087639082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:23,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:23,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:43:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755772726] [2025-03-03 16:43:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:23,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:43:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:23,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:43:23,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:43:23,071 INFO L87 Difference]: Start difference. First operand 2397 states and 3589 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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-03-03 16:43:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:23,953 INFO L93 Difference]: Finished difference Result 4648 states and 6959 transitions. [2025-03-03 16:43:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:43:23,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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 140 [2025-03-03 16:43:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:23,961 INFO L225 Difference]: With dead ends: 4648 [2025-03-03 16:43:23,961 INFO L226 Difference]: Without dead ends: 2401 [2025-03-03 16:43:23,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:43:23,964 INFO L435 NwaCegarLoop]: 2980 mSDtfsCounter, 0 mSDsluCounter, 5947 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8927 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:23,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8927 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:43:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-03-03 16:43:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2397. [2025-03-03 16:43:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2396 states have (on average 1.4979131886477461) internal successors, (3589), 2396 states have internal predecessors, (3589), 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-03-03 16:43:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3589 transitions. [2025-03-03 16:43:23,999 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3589 transitions. Word has length 140 [2025-03-03 16:43:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:23,999 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3589 transitions. [2025-03-03 16:43:23,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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-03-03 16:43:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3589 transitions. [2025-03-03 16:43:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 16:43:24,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:24,000 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, 1, 1, 1, 1, 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-03-03 16:43:24,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:43:24,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:24,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 224536551, now seen corresponding path program 1 times [2025-03-03 16:43:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:24,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551366292] [2025-03-03 16:43:24,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:24,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 16:43:24,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 16:43:24,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:24,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551366292] [2025-03-03 16:43:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551366292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:43:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838422654] [2025-03-03 16:43:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:24,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:43:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:24,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:43:24,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:43:24,292 INFO L87 Difference]: Start difference. First operand 2397 states and 3589 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-03-03 16:43:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:26,719 INFO L93 Difference]: Finished difference Result 6875 states and 10295 transitions. [2025-03-03 16:43:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:43:26,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 141 [2025-03-03 16:43:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:26,730 INFO L225 Difference]: With dead ends: 6875 [2025-03-03 16:43:26,730 INFO L226 Difference]: Without dead ends: 4628 [2025-03-03 16:43:26,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:43:26,733 INFO L435 NwaCegarLoop]: 2337 mSDtfsCounter, 3431 mSDsluCounter, 6871 mSDsCounter, 0 mSdLazyCounter, 4877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 9208 SdHoareTripleChecker+Invalid, 4878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:26,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 9208 Invalid, 4878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4877 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:43:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2025-03-03 16:43:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 2500. [2025-03-03 16:43:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.4973989595838335) internal successors, (3742), 2499 states have internal predecessors, (3742), 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-03-03 16:43:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3742 transitions. [2025-03-03 16:43:26,873 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3742 transitions. Word has length 141 [2025-03-03 16:43:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:26,873 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3742 transitions. [2025-03-03 16:43:26,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-03-03 16:43:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3742 transitions. [2025-03-03 16:43:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 16:43:26,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:26,875 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, 1, 1, 1, 1, 1, 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-03-03 16:43:26,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:43:26,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1383204053, now seen corresponding path program 1 times [2025-03-03 16:43:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891789677] [2025-03-03 16:43:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:26,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 16:43:27,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 16:43:27,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:27,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:27,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891789677] [2025-03-03 16:43:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891789677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:43:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192722788] [2025-03-03 16:43:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:27,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:43:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:27,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:43:27,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:43:27,517 INFO L87 Difference]: Start difference. First operand 2500 states and 3742 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-03-03 16:43:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:29,491 INFO L93 Difference]: Finished difference Result 4762 states and 7128 transitions. [2025-03-03 16:43:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:43:29,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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 142 [2025-03-03 16:43:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:29,496 INFO L225 Difference]: With dead ends: 4762 [2025-03-03 16:43:29,496 INFO L226 Difference]: Without dead ends: 2515 [2025-03-03 16:43:29,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:43:29,498 INFO L435 NwaCegarLoop]: 2318 mSDtfsCounter, 3464 mSDsluCounter, 6942 mSDsCounter, 0 mSdLazyCounter, 5047 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 9260 SdHoareTripleChecker+Invalid, 5048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:29,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 9260 Invalid, 5048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:43:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-03-03 16:43:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2513. [2025-03-03 16:43:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.4956210191082802) internal successors, (3757), 2512 states have internal predecessors, (3757), 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-03-03 16:43:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3757 transitions. [2025-03-03 16:43:29,527 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3757 transitions. Word has length 142 [2025-03-03 16:43:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:29,527 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3757 transitions. [2025-03-03 16:43:29,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-03-03 16:43:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3757 transitions. [2025-03-03 16:43:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 16:43:29,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:29,528 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, 1, 1, 1, 1, 1, 1, 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-03-03 16:43:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:43:29,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1494496185, now seen corresponding path program 1 times [2025-03-03 16:43:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702338371] [2025-03-03 16:43:29,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:29,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 16:43:29,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 16:43:29,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:29,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:43:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702338371] [2025-03-03 16:43:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702338371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:43:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488553030] [2025-03-03 16:43:29,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:43:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:43:29,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:43:29,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:43:29,732 INFO L87 Difference]: Start difference. First operand 2513 states and 3757 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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-03-03 16:43:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:31,262 INFO L93 Difference]: Finished difference Result 4770 states and 7134 transitions. [2025-03-03 16:43:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:43:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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 143 [2025-03-03 16:43:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:31,268 INFO L225 Difference]: With dead ends: 4770 [2025-03-03 16:43:31,268 INFO L226 Difference]: Without dead ends: 2513 [2025-03-03 16:43:31,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:43:31,270 INFO L435 NwaCegarLoop]: 2329 mSDtfsCounter, 3442 mSDsluCounter, 4649 mSDsCounter, 0 mSdLazyCounter, 3739 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 6978 SdHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:31,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 6978 Invalid, 3740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3739 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 16:43:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-03-03 16:43:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2500. [2025-03-03 16:43:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.495798319327731) internal successors, (3738), 2499 states have internal predecessors, (3738), 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-03-03 16:43:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3738 transitions. [2025-03-03 16:43:31,296 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3738 transitions. Word has length 143 [2025-03-03 16:43:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:31,296 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3738 transitions. [2025-03-03 16:43:31,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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-03-03 16:43:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3738 transitions. [2025-03-03 16:43:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 16:43:31,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:31,297 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, 1, 1, 1, 1, 1, 1, 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-03-03 16:43:31,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:43:31,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -41932111, now seen corresponding path program 1 times [2025-03-03 16:43:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:43:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655268072] [2025-03-03 16:43:31,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:43:31,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 16:43:31,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 16:43:31,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:31,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:43:31,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:43:31,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 16:43:31,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 16:43:31,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:31,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:43:31,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:43:31,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:43:31,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 16:43:31,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:43:31,533 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:43:31,607 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 16:43:31,626 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:43:31,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:43:31 BoogieIcfgContainer [2025-03-03 16:43:31,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:43:31,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:43:31,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:43:31,633 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:43:31,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:43:18" (3/4) ... [2025-03-03 16:43:31,636 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 16:43:31,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:43:31,637 INFO L158 Benchmark]: Toolchain (without parser) took 22656.59ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 128.9MB in the beginning and 496.1MB in the end (delta: -367.2MB). Peak memory consumption was 198.3MB. Max. memory is 16.1GB. [2025-03-03 16:43:31,638 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:43:31,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.47ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 128.4MB in the beginning and 110.5MB in the end (delta: 17.9MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. [2025-03-03 16:43:31,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 620.23ms. Allocated memory was 176.2MB in the beginning and 453.0MB in the end (delta: 276.8MB). Free memory was 110.5MB in the beginning and 281.3MB in the end (delta: -170.8MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2025-03-03 16:43:31,638 INFO L158 Benchmark]: Boogie Preprocessor took 675.48ms. Allocated memory is still 453.0MB. Free memory was 281.3MB in the beginning and 251.8MB in the end (delta: 29.5MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2025-03-03 16:43:31,638 INFO L158 Benchmark]: IcfgBuilder took 7190.44ms. Allocated memory was 453.0MB in the beginning and 1.1GB in the end (delta: 671.1MB). Free memory was 251.8MB in the beginning and 317.3MB in the end (delta: -65.6MB). Peak memory consumption was 702.0MB. Max. memory is 16.1GB. [2025-03-03 16:43:31,638 INFO L158 Benchmark]: TraceAbstraction took 13456.78ms. Allocated memory was 1.1GB in the beginning and 729.8MB in the end (delta: -394.3MB). Free memory was 317.3MB in the beginning and 496.1MB in the end (delta: -178.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:43:31,639 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 729.8MB. Free memory was 496.1MB in the beginning and 496.1MB in the end (delta: 62.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:43:31,640 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.47ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 128.4MB in the beginning and 110.5MB in the end (delta: 17.9MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 620.23ms. Allocated memory was 176.2MB in the beginning and 453.0MB in the end (delta: 276.8MB). Free memory was 110.5MB in the beginning and 281.3MB in the end (delta: -170.8MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 675.48ms. Allocated memory is still 453.0MB. Free memory was 281.3MB in the beginning and 251.8MB in the end (delta: 29.5MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * IcfgBuilder took 7190.44ms. Allocated memory was 453.0MB in the beginning and 1.1GB in the end (delta: 671.1MB). Free memory was 251.8MB in the beginning and 317.3MB in the end (delta: -65.6MB). Peak memory consumption was 702.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13456.78ms. Allocated memory was 1.1GB in the beginning and 729.8MB in the end (delta: -394.3MB). Free memory was 317.3MB in the beginning and 496.1MB in the end (delta: -178.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 729.8MB. Free memory was 496.1MB in the beginning and 496.1MB in the end (delta: 62.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 289, overapproximation of bitwiseAnd at line 287. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_38 = 0; [L40] const SORT_4 var_81 = 1; [L41] const SORT_4 var_82 = 0; [L42] const SORT_2 var_94 = 0; [L43] const SORT_2 var_96 = 1; [L44] const SORT_3 var_116 = 0; [L45] const SORT_2 var_158 = 2; [L46] const SORT_4 var_306 = 4; [L47] const SORT_2 var_318 = 4; [L48] const SORT_4 var_320 = 12; [L49] const SORT_4 var_425 = 2; [L50] const SORT_4 var_469 = 3; [L52] SORT_1 input_93; [L53] SORT_1 input_95; [L54] SORT_1 input_100; [L55] SORT_1 input_101; [L56] SORT_1 input_105; [L57] SORT_1 input_106; [L58] SORT_1 input_110; [L59] SORT_1 input_111; [L60] SORT_1 input_115; [L61] SORT_1 input_123; [L62] SORT_1 input_130; [L63] SORT_1 input_137; [L64] SORT_1 input_144; [L65] SORT_1 input_148; [L66] SORT_1 input_149; [L67] SORT_1 input_166; [L68] SORT_1 input_170; [L69] SORT_1 input_171; [L70] SORT_1 input_187; [L71] SORT_1 input_191; [L72] SORT_1 input_192; [L73] SORT_1 input_208; [L74] SORT_1 input_212; [L75] SORT_1 input_213; [L76] SORT_1 input_236; [L77] SORT_1 input_239; [L78] SORT_1 input_255; [L79] SORT_1 input_258; [L80] SORT_1 input_274; [L81] SORT_1 input_277; [L82] SORT_1 input_293; [L83] SORT_1 input_296; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L85] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L86] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L87] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L88] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L89] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L90] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L91] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L92] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L93] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L94] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L95] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L96] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L97] SORT_2 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L98] SORT_2 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L99] SORT_2 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L100] SORT_2 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L101] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L102] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L103] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L104] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L105] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L106] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L107] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L108] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L109] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L110] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L111] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L112] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L113] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L114] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L115] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L116] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L117] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L118] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L119] SORT_1 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L120] SORT_1 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_38=0, var_425=2, var_469=3, var_5=0, var_81=1, var_82=0, var_94=0, var_96=1] [L121] SORT_1 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] SORT_2 init_7_arg_1 = var_5; [L124] state_6 = init_7_arg_1 [L125] SORT_2 init_9_arg_1 = var_5; [L126] state_8 = init_9_arg_1 [L127] SORT_2 init_11_arg_1 = var_5; [L128] state_10 = init_11_arg_1 [L129] SORT_2 init_13_arg_1 = var_5; [L130] state_12 = init_13_arg_1 [L131] SORT_2 init_15_arg_1 = var_5; [L132] state_14 = init_15_arg_1 [L133] SORT_2 init_17_arg_1 = var_5; [L134] state_16 = init_17_arg_1 [L135] SORT_2 init_19_arg_1 = var_5; [L136] state_18 = init_19_arg_1 [L137] SORT_2 init_21_arg_1 = var_5; [L138] state_20 = init_21_arg_1 [L139] SORT_2 init_23_arg_1 = var_5; [L140] state_22 = init_23_arg_1 [L141] SORT_2 init_25_arg_1 = var_5; [L142] state_24 = init_25_arg_1 [L143] SORT_2 init_27_arg_1 = var_5; [L144] state_26 = init_27_arg_1 [L145] SORT_2 init_29_arg_1 = var_5; [L146] state_28 = init_29_arg_1 [L147] SORT_2 init_31_arg_1 = var_5; [L148] state_30 = init_31_arg_1 [L149] SORT_2 init_33_arg_1 = var_5; [L150] state_32 = init_33_arg_1 [L151] SORT_2 init_35_arg_1 = var_5; [L152] state_34 = init_35_arg_1 [L153] SORT_2 init_37_arg_1 = var_5; [L154] state_36 = init_37_arg_1 [L155] SORT_1 init_40_arg_1 = var_38; [L156] state_39 = init_40_arg_1 [L157] SORT_1 init_42_arg_1 = var_38; [L158] state_41 = init_42_arg_1 [L159] SORT_1 init_44_arg_1 = var_38; [L160] state_43 = init_44_arg_1 [L161] SORT_1 init_46_arg_1 = var_38; [L162] state_45 = init_46_arg_1 [L163] SORT_1 init_48_arg_1 = var_38; [L164] state_47 = init_48_arg_1 [L165] SORT_1 init_50_arg_1 = var_38; [L166] state_49 = init_50_arg_1 [L167] SORT_1 init_52_arg_1 = var_38; [L168] state_51 = init_52_arg_1 [L169] SORT_1 init_54_arg_1 = var_38; [L170] state_53 = init_54_arg_1 [L171] SORT_1 init_56_arg_1 = var_38; [L172] state_55 = init_56_arg_1 [L173] SORT_1 init_58_arg_1 = var_38; [L174] state_57 = init_58_arg_1 [L175] SORT_1 init_60_arg_1 = var_38; [L176] state_59 = init_60_arg_1 [L177] SORT_1 init_62_arg_1 = var_38; [L178] state_61 = init_62_arg_1 [L179] SORT_1 init_64_arg_1 = var_38; [L180] state_63 = init_64_arg_1 [L181] SORT_1 init_66_arg_1 = var_38; [L182] state_65 = init_66_arg_1 [L183] SORT_1 init_68_arg_1 = var_38; [L184] state_67 = init_68_arg_1 [L185] SORT_1 init_70_arg_1 = var_38; [L186] state_69 = init_70_arg_1 [L187] SORT_1 init_72_arg_1 = var_38; [L188] state_71 = init_72_arg_1 [L189] SORT_1 init_74_arg_1 = var_38; [L190] state_73 = init_74_arg_1 [L191] SORT_1 init_76_arg_1 = var_38; [L192] state_75 = init_76_arg_1 [L193] SORT_1 init_78_arg_1 = var_38; [L194] state_77 = init_78_arg_1 [L195] SORT_1 init_80_arg_1 = var_38; [L196] state_79 = init_80_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L199] input_93 = __VERIFIER_nondet_uchar() [L200] EXPR input_93 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L200] input_93 = input_93 & mask_SORT_1 [L201] input_95 = __VERIFIER_nondet_uchar() [L202] EXPR input_95 & mask_SORT_1 VAL [input_93=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L202] input_95 = input_95 & mask_SORT_1 [L203] input_100 = __VERIFIER_nondet_uchar() [L204] EXPR input_100 & mask_SORT_1 VAL [input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L204] input_100 = input_100 & mask_SORT_1 [L205] input_101 = __VERIFIER_nondet_uchar() [L206] EXPR input_101 & mask_SORT_1 VAL [input_100=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L206] input_101 = input_101 & mask_SORT_1 [L207] input_105 = __VERIFIER_nondet_uchar() [L208] EXPR input_105 & mask_SORT_1 VAL [input_100=0, input_101=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L208] input_105 = input_105 & mask_SORT_1 [L209] input_106 = __VERIFIER_nondet_uchar() [L210] EXPR input_106 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L210] input_106 = input_106 & mask_SORT_1 [L211] input_110 = __VERIFIER_nondet_uchar() [L212] EXPR input_110 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L212] input_110 = input_110 & mask_SORT_1 [L213] input_111 = __VERIFIER_nondet_uchar() [L214] EXPR input_111 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L214] input_111 = input_111 & mask_SORT_1 [L215] input_115 = __VERIFIER_nondet_uchar() [L216] EXPR input_115 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L216] input_115 = input_115 & mask_SORT_1 [L217] input_123 = __VERIFIER_nondet_uchar() [L218] EXPR input_123 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L218] input_123 = input_123 & mask_SORT_1 [L219] input_130 = __VERIFIER_nondet_uchar() [L220] EXPR input_130 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L220] input_130 = input_130 & mask_SORT_1 [L221] input_137 = __VERIFIER_nondet_uchar() [L222] EXPR input_137 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L222] input_137 = input_137 & mask_SORT_1 [L223] input_144 = __VERIFIER_nondet_uchar() [L224] EXPR input_144 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L224] input_144 = input_144 & mask_SORT_1 [L225] input_148 = __VERIFIER_nondet_uchar() [L226] EXPR input_148 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L226] input_148 = input_148 & mask_SORT_1 [L227] input_149 = __VERIFIER_nondet_uchar() [L228] EXPR input_149 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L228] input_149 = input_149 & mask_SORT_1 [L229] input_166 = __VERIFIER_nondet_uchar() [L230] EXPR input_166 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L230] input_166 = input_166 & mask_SORT_1 [L231] input_170 = __VERIFIER_nondet_uchar() [L232] EXPR input_170 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L232] input_170 = input_170 & mask_SORT_1 [L233] input_171 = __VERIFIER_nondet_uchar() [L234] EXPR input_171 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L234] input_171 = input_171 & mask_SORT_1 [L235] input_187 = __VERIFIER_nondet_uchar() [L236] EXPR input_187 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L236] input_187 = input_187 & mask_SORT_1 [L237] input_191 = __VERIFIER_nondet_uchar() [L238] EXPR input_191 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L238] input_191 = input_191 & mask_SORT_1 [L239] input_192 = __VERIFIER_nondet_uchar() [L240] EXPR input_192 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L240] input_192 = input_192 & mask_SORT_1 [L241] input_208 = __VERIFIER_nondet_uchar() [L242] EXPR input_208 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L242] input_208 = input_208 & mask_SORT_1 [L243] input_212 = __VERIFIER_nondet_uchar() [L244] EXPR input_212 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L244] input_212 = input_212 & mask_SORT_1 [L245] input_213 = __VERIFIER_nondet_uchar() [L246] EXPR input_213 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L246] input_213 = input_213 & mask_SORT_1 [L247] input_236 = __VERIFIER_nondet_uchar() [L248] input_239 = __VERIFIER_nondet_uchar() [L249] input_255 = __VERIFIER_nondet_uchar() [L250] input_258 = __VERIFIER_nondet_uchar() [L251] input_274 = __VERIFIER_nondet_uchar() [L252] input_277 = __VERIFIER_nondet_uchar() [L253] input_293 = __VERIFIER_nondet_uchar() [L254] input_296 = __VERIFIER_nondet_uchar() [L257] SORT_1 var_83_arg_0 = state_47; [L258] SORT_4 var_83_arg_1 = var_81; [L259] SORT_4 var_83_arg_2 = var_82; [L260] SORT_4 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L261] SORT_1 var_84_arg_0 = state_57; [L262] SORT_4 var_84_arg_1 = var_81; [L263] SORT_4 var_84_arg_2 = var_82; [L264] SORT_4 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L265] SORT_4 var_85_arg_0 = var_83; [L266] SORT_4 var_85_arg_1 = var_84; [L267] SORT_4 var_85 = var_85_arg_0 + var_85_arg_1; [L268] SORT_1 var_86_arg_0 = state_67; [L269] SORT_4 var_86_arg_1 = var_81; [L270] SORT_4 var_86_arg_2 = var_82; [L271] SORT_4 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L272] SORT_4 var_87_arg_0 = var_85; [L273] SORT_4 var_87_arg_1 = var_86; [L274] SORT_4 var_87 = var_87_arg_0 + var_87_arg_1; [L275] SORT_1 var_88_arg_0 = state_77; [L276] SORT_4 var_88_arg_1 = var_81; [L277] SORT_4 var_88_arg_2 = var_82; [L278] SORT_4 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L279] SORT_4 var_89_arg_0 = var_87; [L280] SORT_4 var_89_arg_1 = var_88; [L281] SORT_4 var_89 = var_89_arg_0 + var_89_arg_1; VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_89=0, var_94=0, var_96=1] [L282] EXPR var_89 & mask_SORT_4 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L282] var_89 = var_89 & mask_SORT_4 [L283] SORT_4 var_90_arg_0 = var_89; [L284] SORT_4 var_90_arg_1 = var_81; [L285] SORT_1 var_90 = var_90_arg_0 <= var_90_arg_1; [L286] SORT_1 var_91_arg_0 = ~state_79; VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_90=1, var_91_arg_0=-1, var_94=0, var_96=1] [L287] EXPR var_91_arg_0 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_90=1, var_94=0, var_96=1] [L287] var_91_arg_0 = var_91_arg_0 & mask_SORT_1 [L288] SORT_1 var_91_arg_1 = ~var_90; VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_91_arg_0=1, var_91_arg_1=-2, var_94=0, var_96=1] [L289] EXPR var_91_arg_1 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_91_arg_0=1, var_94=0, var_96=1] [L289] var_91_arg_1 = var_91_arg_1 & mask_SORT_1 [L290] EXPR var_91_arg_0 & var_91_arg_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L290] SORT_1 var_91 = var_91_arg_0 & var_91_arg_1; [L291] EXPR var_91 & mask_SORT_1 VAL [input_100=0, input_101=0, input_105=0, input_106=0, input_110=0, input_111=0, input_115=0, input_123=0, input_130=0, input_137=0, input_144=0, input_148=0, input_149=0, input_166=0, input_170=0, input_171=0, input_187=0, input_191=0, input_192=0, input_208=0, input_212=0, input_213=0, input_93=0, input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_8=0, var_116=0, var_158=2, var_306=4, var_318=4, var_320=12, var_425=2, var_469=3, var_81=1, var_82=0, var_94=0, var_96=1] [L291] var_91 = var_91 & mask_SORT_1 [L292] SORT_1 bad_92_arg_0 = var_91; [L293] CALL __VERIFIER_assert(!(bad_92_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2390 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10341 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10341 mSDsluCounter, 61167 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42263 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20863 IncrementalHoareTripleChecker+Invalid, 20867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 18904 mSDtfsCounter, 20863 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2513occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 2147 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 1123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 2865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 could not prove your program: unable to determine feasibility of some traces [2025-03-03 16:43:31,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 87137514c5ae1920d86e25d4c779abc7db4fd5f20bd8e328e0fe081c42450842 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:43:33,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:43:33,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 16:43:33,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:43:33,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:43:33,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:43:33,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:43:33,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:43:33,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:43:33,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:43:33,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:43:33,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:43:33,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:43:33,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:43:33,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:43:33,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:43:33,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:43:33,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:43:33,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:43:33,717 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/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 -> 87137514c5ae1920d86e25d4c779abc7db4fd5f20bd8e328e0fe081c42450842 [2025-03-03 16:43:33,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:43:33,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:43:33,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:43:33,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:43:33,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:43:33,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c [2025-03-03 16:43:35,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0011cec5/a7e0acb7dd254eaf9d21b6456dc44d53/FLAGdc1b45628 [2025-03-03 16:43:35,373 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:43:35,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c [2025-03-03 16:43:35,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0011cec5/a7e0acb7dd254eaf9d21b6456dc44d53/FLAGdc1b45628 [2025-03-03 16:43:35,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0011cec5/a7e0acb7dd254eaf9d21b6456dc44d53 [2025-03-03 16:43:35,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:43:35,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:43:35,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:43:35,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:43:35,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:43:35,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:35,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400316ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35, skipping insertion in model container [2025-03-03 16:43:35,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:35,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:43:35,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c[1173,1186] [2025-03-03 16:43:35,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:43:35,856 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:43:35,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.7.prop1-func-interl.c[1173,1186] [2025-03-03 16:43:35,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:43:35,977 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:43:35,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35 WrapperNode [2025-03-03 16:43:35,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:43:35,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:43:35,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:43:35,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:43:35,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,082 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2228 [2025-03-03 16:43:36,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:43:36,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:43:36,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:43:36,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:43:36,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,144 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-03-03 16:43:36,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:43:36,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:43:36,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:43:36,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:43:36,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (1/1) ... [2025-03-03 16:43:36,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:43:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:43:36,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:43:36,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:43:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:43:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 16:43:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:43:36,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:43:36,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:43:36,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:43:38,242 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-03 16:43:38,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:43:38,247 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:43:38,247 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:43:38,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:43:38 BoogieIcfgContainer [2025-03-03 16:43:38,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:43:38,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:43:38,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:43:38,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:43:38,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:43:35" (1/3) ... [2025-03-03 16:43:38,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fbc4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:43:38, skipping insertion in model container [2025-03-03 16:43:38,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:43:35" (2/3) ... [2025-03-03 16:43:38,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fbc4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:43:38, skipping insertion in model container [2025-03-03 16:43:38,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:43:38" (3/3) ... [2025-03-03 16:43:38,256 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.7.prop1-func-interl.c [2025-03-03 16:43:38,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:43:38,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.7.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:43:38,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:43:38,309 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;@6ff78655, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:43:38,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:43:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:43:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 16:43:38,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:38,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 16:43:38,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:38,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 16:43:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:43:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256302929] [2025-03-03 16:43:38,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:38,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:43:38,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:43:38,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:43:38,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:43:38,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 16:43:38,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 16:43:38,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:38,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:38,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 16:43:38,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:43:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:43:38,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:43:38,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:43:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256302929] [2025-03-03 16:43:38,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256302929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:43:38,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:43:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:43:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510041628] [2025-03-03 16:43:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:43:38,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:43:38,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:43:38,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:43:38,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:43:38,977 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:43:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:43:39,150 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 16:43:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:43:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 16:43:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:43:39,159 INFO L225 Difference]: With dead ends: 18 [2025-03-03 16:43:39,159 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 16:43:39,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:43:39,164 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:43:39,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:43:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 16:43:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 16:43:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:43:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 16:43:39,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 16:43:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:43:39,188 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 16:43:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:43:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 16:43:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 16:43:39,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:43:39,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 16:43:39,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:43:39,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:43:39,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:43:39,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:43:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 16:43:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:43:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774058938] [2025-03-03 16:43:39,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:43:39,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:43:39,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:43:39,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:43:39,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:43:39,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 16:43:39,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 16:43:39,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:43:39,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:43:39,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-03 16:43:39,929 INFO L279 TraceCheckSpWp]: Computing forward predicates...