./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.peterson.2.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 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:09:19,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:09:19,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:09:19,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:09:19,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:09:19,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:09:19,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:09:19,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:09:19,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:09:19,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:09:19,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:09:19,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:09:19,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:09:19,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:09:19,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:09:19,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:09:19,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:09:19,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:09:19,705 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 -> 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 [2025-03-08 09:09:19,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:09:19,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:09:19,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:09:19,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:09:19,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:09:19,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2025-03-08 09:09:21,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a067228d/0509dafb98464aa3b04707a9c23a0884/FLAGa64c1234a [2025-03-08 09:09:21,386 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:09:21,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2025-03-08 09:09:21,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a067228d/0509dafb98464aa3b04707a9c23a0884/FLAGa64c1234a [2025-03-08 09:09:21,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a067228d/0509dafb98464aa3b04707a9c23a0884 [2025-03-08 09:09:21,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:09:21,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:09:21,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:09:21,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:09:21,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:09:21,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:09:21" (1/1) ... [2025-03-08 09:09:21,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:21, skipping insertion in model container [2025-03-08 09:09:21,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:09:21" (1/1) ... [2025-03-08 09:09:21,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:09:21,788 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.peterson.2.prop1-func-interl.c[1175,1188] [2025-03-08 09:09:22,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:09:22,008 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:09:22,014 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.peterson.2.prop1-func-interl.c[1175,1188] [2025-03-08 09:09:22,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:09:22,111 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:09:22,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22 WrapperNode [2025-03-08 09:09:22,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:09:22,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:09:22,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:09:22,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:09:22,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,484 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4858 [2025-03-08 09:09:22,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:09:22,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:09:22,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:09:22,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:09:22,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,729 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-08 09:09:22,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:22,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:23,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:09:23,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:09:23,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:09:23,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:09:23,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (1/1) ... [2025-03-08 09:09:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:09:23,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:09:23,064 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-08 09:09:23,066 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-08 09:09:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:09:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:09:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:09:23,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:09:23,390 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:09:23,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:09:27,286 INFO L? ?]: Removed 2711 outVars from TransFormulas that were not future-live. [2025-03-08 09:09:27,286 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:09:27,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:09:27,458 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:09:27,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:27 BoogieIcfgContainer [2025-03-08 09:09:27,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:09:27,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:09:27,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:09:27,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:09:27,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:09:21" (1/3) ... [2025-03-08 09:09:27,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74da92f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:09:27, skipping insertion in model container [2025-03-08 09:09:27,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:22" (2/3) ... [2025-03-08 09:09:27,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74da92f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:09:27, skipping insertion in model container [2025-03-08 09:09:27,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:27" (3/3) ... [2025-03-08 09:09:27,466 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peterson.2.prop1-func-interl.c [2025-03-08 09:09:27,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:09:27,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.peterson.2.prop1-func-interl.c that has 1 procedures, 1670 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:09:27,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:09:27,584 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;@161b2af9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:09:27,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:09:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 1670 states, 1668 states have (on average 1.499400479616307) internal successors, (2501), 1669 states have internal predecessors, (2501), 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-08 09:09:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 09:09:27,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:27,603 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] [2025-03-08 09:09:27,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2069735359, now seen corresponding path program 1 times [2025-03-08 09:09:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627925854] [2025-03-08 09:09:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:27,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 09:09:27,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 09:09:27,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:27,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:28,673 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-08 09:09:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:09:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627925854] [2025-03-08 09:09:28,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627925854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:28,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:09:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656468979] [2025-03-08 09:09:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:28,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:09:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:09:28,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:09:28,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:09:28,704 INFO L87 Difference]: Start difference. First operand has 1670 states, 1668 states have (on average 1.499400479616307) internal successors, (2501), 1669 states have internal predecessors, (2501), 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 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-08 09:09:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:30,939 INFO L93 Difference]: Finished difference Result 4764 states and 7141 transitions. [2025-03-08 09:09:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:09:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 107 [2025-03-08 09:09:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:30,957 INFO L225 Difference]: With dead ends: 4764 [2025-03-08 09:09:30,958 INFO L226 Difference]: Without dead ends: 3208 [2025-03-08 09:09:30,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-08 09:09:30,965 INFO L435 NwaCegarLoop]: 1605 mSDtfsCounter, 2382 mSDsluCounter, 4700 mSDsCounter, 0 mSdLazyCounter, 3514 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 6305 SdHoareTripleChecker+Invalid, 3515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:09:30,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2382 Valid, 6305 Invalid, 3515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3514 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 09:09:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-03-08 09:09:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 1746. [2025-03-08 09:09:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1745 states have (on average 1.4979942693409742) internal successors, (2614), 1745 states have internal predecessors, (2614), 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-08 09:09:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2614 transitions. [2025-03-08 09:09:31,061 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2614 transitions. Word has length 107 [2025-03-08 09:09:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:31,062 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2614 transitions. [2025-03-08 09:09:31,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-08 09:09:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2614 transitions. [2025-03-08 09:09:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 09:09:31,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:31,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:31,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:09:31,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:31,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1394827395, now seen corresponding path program 1 times [2025-03-08 09:09:31,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:31,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844253526] [2025-03-08 09:09:31,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:31,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 09:09:31,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 09:09:31,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:31,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:31,413 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-08 09:09:31,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:09:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844253526] [2025-03-08 09:09:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844253526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:09:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783392650] [2025-03-08 09:09:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:09:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:09:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:09:31,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:09:31,415 INFO L87 Difference]: Start difference. First operand 1746 states and 2614 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:32,005 INFO L93 Difference]: Finished difference Result 1750 states and 2618 transitions. [2025-03-08 09:09:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:09:32,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-08 09:09:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:32,010 INFO L225 Difference]: With dead ends: 1750 [2025-03-08 09:09:32,011 INFO L226 Difference]: Without dead ends: 1748 [2025-03-08 09:09:32,011 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-08 09:09:32,012 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 0 mSDsluCounter, 4155 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6235 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:09:32,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6235 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:09:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2025-03-08 09:09:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2025-03-08 09:09:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.497424155695478) internal successors, (2616), 1747 states have internal predecessors, (2616), 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-08 09:09:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2616 transitions. [2025-03-08 09:09:32,041 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2616 transitions. Word has length 109 [2025-03-08 09:09:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:32,041 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2616 transitions. [2025-03-08 09:09:32,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2616 transitions. [2025-03-08 09:09:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 09:09:32,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:32,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:32,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:09:32,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:32,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -285294592, now seen corresponding path program 1 times [2025-03-08 09:09:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:32,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512206870] [2025-03-08 09:09:32,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:32,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 09:09:32,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 09:09:32,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:32,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:32,237 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-08 09:09:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:09:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512206870] [2025-03-08 09:09:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512206870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:32,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:32,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:09:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631298787] [2025-03-08 09:09:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:32,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:09:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:09:32,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:09:32,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:09:32,238 INFO L87 Difference]: Start difference. First operand 1748 states and 2616 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:32,811 INFO L93 Difference]: Finished difference Result 3305 states and 4948 transitions. [2025-03-08 09:09:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:09:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 09:09:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:32,818 INFO L225 Difference]: With dead ends: 3305 [2025-03-08 09:09:32,818 INFO L226 Difference]: Without dead ends: 1750 [2025-03-08 09:09:32,820 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-08 09:09:32,822 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 0 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:09:32,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6232 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:09:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2025-03-08 09:09:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2025-03-08 09:09:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 1.4968553459119496) internal successors, (2618), 1749 states have internal predecessors, (2618), 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-08 09:09:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2618 transitions. [2025-03-08 09:09:32,874 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2618 transitions. Word has length 110 [2025-03-08 09:09:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:32,874 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2618 transitions. [2025-03-08 09:09:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2618 transitions. [2025-03-08 09:09:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 09:09:32,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:32,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:32,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:09:32,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:32,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1677314008, now seen corresponding path program 1 times [2025-03-08 09:09:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:32,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119387550] [2025-03-08 09:09:32,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 09:09:32,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 09:09:32,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:32,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:33,268 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-08 09:09:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:09:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119387550] [2025-03-08 09:09:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119387550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:09:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321500428] [2025-03-08 09:09:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:33,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:09:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:09:33,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:09:33,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:09:33,271 INFO L87 Difference]: Start difference. First operand 1750 states and 2618 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:34,566 INFO L93 Difference]: Finished difference Result 3319 states and 4965 transitions. [2025-03-08 09:09:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:09:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 09:09:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:34,577 INFO L225 Difference]: With dead ends: 3319 [2025-03-08 09:09:34,577 INFO L226 Difference]: Without dead ends: 1762 [2025-03-08 09:09:34,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:09:34,581 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2417 mSDsluCounter, 5698 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 7760 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:09:34,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 7760 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 09:09:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-08 09:09:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1759. [2025-03-08 09:09:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1758 states have (on average 1.4954493742889647) internal successors, (2629), 1758 states have internal predecessors, (2629), 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-08 09:09:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2629 transitions. [2025-03-08 09:09:34,624 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2629 transitions. Word has length 111 [2025-03-08 09:09:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:34,625 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2629 transitions. [2025-03-08 09:09:34,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2629 transitions. [2025-03-08 09:09:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 09:09:34,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:34,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:34,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:09:34,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:34,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1949475547, now seen corresponding path program 1 times [2025-03-08 09:09:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:34,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084339030] [2025-03-08 09:09:34,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:34,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 09:09:34,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 09:09:34,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:34,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:35,061 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-08 09:09:35,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:09:35,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084339030] [2025-03-08 09:09:35,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084339030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:35,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:35,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:09:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085896332] [2025-03-08 09:09:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:35,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:09:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:09:35,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:09:35,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:09:35,063 INFO L87 Difference]: Start difference. First operand 1759 states and 2629 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:36,637 INFO L93 Difference]: Finished difference Result 3326 states and 4974 transitions. [2025-03-08 09:09:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:09:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 09:09:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:36,642 INFO L225 Difference]: With dead ends: 3326 [2025-03-08 09:09:36,642 INFO L226 Difference]: Without dead ends: 1763 [2025-03-08 09:09:36,644 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-08 09:09:36,644 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 2414 mSDsluCounter, 4737 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2414 SdHoareTripleChecker+Valid, 6320 SdHoareTripleChecker+Invalid, 3668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:09:36,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2414 Valid, 6320 Invalid, 3668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 09:09:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-08 09:09:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1760. [2025-03-08 09:09:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1759 states have (on average 1.495167708925526) internal successors, (2630), 1759 states have internal predecessors, (2630), 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-08 09:09:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2630 transitions. [2025-03-08 09:09:36,667 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2630 transitions. Word has length 112 [2025-03-08 09:09:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:36,667 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2630 transitions. [2025-03-08 09:09:36,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2630 transitions. [2025-03-08 09:09:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 09:09:36,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:36,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:36,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:09:36,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 202728167, now seen corresponding path program 1 times [2025-03-08 09:09:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232741620] [2025-03-08 09:09:36,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 09:09:36,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 09:09:36,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:37,262 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-08 09:09:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:09:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232741620] [2025-03-08 09:09:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232741620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:37,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:09:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220452214] [2025-03-08 09:09:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:37,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:09:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:09:37,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:09:37,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:09:37,265 INFO L87 Difference]: Start difference. First operand 1760 states and 2630 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:38,096 INFO L93 Difference]: Finished difference Result 4442 states and 6640 transitions. [2025-03-08 09:09:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:09:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 09:09:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:38,104 INFO L225 Difference]: With dead ends: 4442 [2025-03-08 09:09:38,105 INFO L226 Difference]: Without dead ends: 2873 [2025-03-08 09:09:38,107 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-08 09:09:38,108 INFO L435 NwaCegarLoop]: 2068 mSDtfsCounter, 1854 mSDsluCounter, 6054 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 8122 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:09:38,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 8122 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 09:09:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2025-03-08 09:09:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1755. [2025-03-08 09:09:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.4954389965792474) internal successors, (2623), 1754 states have internal predecessors, (2623), 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-08 09:09:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2623 transitions. [2025-03-08 09:09:38,136 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2623 transitions. Word has length 112 [2025-03-08 09:09:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:38,136 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2623 transitions. [2025-03-08 09:09:38,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:09:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2623 transitions. [2025-03-08 09:09:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 09:09:38,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:38,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:09:38,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 930784325, now seen corresponding path program 1 times [2025-03-08 09:09:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:09:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640996122] [2025-03-08 09:09:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:09:38,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 09:09:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 09:09:38,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:38,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:09:38,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:09:38,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 09:09:38,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 09:09:38,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:38,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:09:38,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:09:38,389 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:09:38,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:09:38,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:09:38,399 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:38,457 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:09:38,476 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:09:38,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:09:38 BoogieIcfgContainer [2025-03-08 09:09:38,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:09:38,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:09:38,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:09:38,483 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:09:38,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:27" (3/4) ... [2025-03-08 09:09:38,485 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:09:38,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:09:38,490 INFO L158 Benchmark]: Toolchain (without parser) took 16855.61ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 151.8MB in the beginning and 296.4MB in the end (delta: -144.5MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2025-03-08 09:09:38,490 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:09:38,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.26ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 87.8MB in the end (delta: 64.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 09:09:38,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 371.26ms. Allocated memory is still 201.3MB. Free memory was 87.8MB in the beginning and 67.3MB in the end (delta: 20.5MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2025-03-08 09:09:38,490 INFO L158 Benchmark]: Boogie Preprocessor took 547.97ms. Allocated memory was 201.3MB in the beginning and 562.0MB in the end (delta: 360.7MB). Free memory was 67.3MB in the beginning and 430.2MB in the end (delta: -362.9MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2025-03-08 09:09:38,490 INFO L158 Benchmark]: IcfgBuilder took 4424.32ms. Allocated memory is still 562.0MB. Free memory was 430.2MB in the beginning and 212.6MB in the end (delta: 217.5MB). Peak memory consumption was 324.7MB. Max. memory is 16.1GB. [2025-03-08 09:09:38,490 INFO L158 Benchmark]: TraceAbstraction took 11022.06ms. Allocated memory was 562.0MB in the beginning and 478.2MB in the end (delta: -83.9MB). Free memory was 208.5MB in the beginning and 296.4MB in the end (delta: -88.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:09:38,491 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 478.2MB. Free memory was 296.4MB in the beginning and 296.4MB in the end (delta: 45.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:09:38,492 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.21ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.26ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 87.8MB in the end (delta: 64.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 371.26ms. Allocated memory is still 201.3MB. Free memory was 87.8MB in the beginning and 67.3MB in the end (delta: 20.5MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 547.97ms. Allocated memory was 201.3MB in the beginning and 562.0MB in the end (delta: 360.7MB). Free memory was 67.3MB in the beginning and 430.2MB in the end (delta: -362.9MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * IcfgBuilder took 4424.32ms. Allocated memory is still 562.0MB. Free memory was 430.2MB in the beginning and 212.6MB in the end (delta: 217.5MB). Peak memory consumption was 324.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11022.06ms. Allocated memory was 562.0MB in the beginning and 478.2MB in the end (delta: -83.9MB). Free memory was 208.5MB in the beginning and 296.4MB in the end (delta: -88.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 478.2MB. Free memory was 296.4MB in the beginning and 296.4MB in the end (delta: 45.6kB). 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 225, overapproximation of bitwiseAnd at line 223. 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_30 = 0; [L40] const SORT_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_3 var_90 = 0; [L44] const SORT_2 var_95 = 2; [L45] const SORT_2 var_101 = 1; [L46] const SORT_4 var_121 = 2; [L47] const SORT_4 var_229 = 3; [L48] const SORT_2 var_251 = 3; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_79; [L53] SORT_1 input_80; [L54] SORT_1 input_84; [L55] SORT_1 input_85; [L56] SORT_1 input_89; [L57] SORT_1 input_96; [L58] SORT_1 input_102; [L59] SORT_1 input_132; [L60] SORT_1 input_135; [L61] SORT_1 input_139; [L62] SORT_1 input_146; [L63] SORT_1 input_149; [L64] SORT_1 input_153; [L65] SORT_1 input_160; [L66] SORT_1 input_163; [L67] SORT_1 input_167; [L68] SORT_1 input_177; [L69] SORT_1 input_195; [L70] SORT_1 input_213; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L72] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L73] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L74] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L75] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L76] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L77] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L78] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L79] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L80] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L81] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L82] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L83] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L84] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L85] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L86] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L87] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L88] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L89] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L90] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L91] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L92] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L93] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L94] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L95] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L96] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L97] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L98] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L99] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] SORT_2 init_7_arg_1 = var_5; [L102] state_6 = init_7_arg_1 [L103] SORT_2 init_9_arg_1 = var_5; [L104] state_8 = init_9_arg_1 [L105] SORT_2 init_11_arg_1 = var_5; [L106] state_10 = init_11_arg_1 [L107] SORT_2 init_13_arg_1 = var_5; [L108] state_12 = init_13_arg_1 [L109] SORT_2 init_15_arg_1 = var_5; [L110] state_14 = init_15_arg_1 [L111] SORT_2 init_17_arg_1 = var_5; [L112] state_16 = init_17_arg_1 [L113] SORT_2 init_19_arg_1 = var_5; [L114] state_18 = init_19_arg_1 [L115] SORT_2 init_21_arg_1 = var_5; [L116] state_20 = init_21_arg_1 [L117] SORT_2 init_23_arg_1 = var_5; [L118] state_22 = init_23_arg_1 [L119] SORT_2 init_25_arg_1 = var_5; [L120] state_24 = init_25_arg_1 [L121] SORT_2 init_27_arg_1 = var_5; [L122] state_26 = init_27_arg_1 [L123] SORT_2 init_29_arg_1 = var_5; [L124] state_28 = init_29_arg_1 [L125] SORT_1 init_32_arg_1 = var_30; [L126] state_31 = init_32_arg_1 [L127] SORT_1 init_34_arg_1 = var_30; [L128] state_33 = init_34_arg_1 [L129] SORT_1 init_36_arg_1 = var_30; [L130] state_35 = init_36_arg_1 [L131] SORT_1 init_38_arg_1 = var_30; [L132] state_37 = init_38_arg_1 [L133] SORT_1 init_40_arg_1 = var_30; [L134] state_39 = init_40_arg_1 [L135] SORT_1 init_42_arg_1 = var_30; [L136] state_41 = init_42_arg_1 [L137] SORT_1 init_44_arg_1 = var_30; [L138] state_43 = init_44_arg_1 [L139] SORT_1 init_46_arg_1 = var_30; [L140] state_45 = init_46_arg_1 [L141] SORT_1 init_48_arg_1 = var_30; [L142] state_47 = init_48_arg_1 [L143] SORT_1 init_50_arg_1 = var_30; [L144] state_49 = init_50_arg_1 [L145] SORT_1 init_52_arg_1 = var_30; [L146] state_51 = init_52_arg_1 [L147] SORT_1 init_54_arg_1 = var_30; [L148] state_53 = init_54_arg_1 [L149] SORT_1 init_56_arg_1 = var_30; [L150] state_55 = init_56_arg_1 [L151] SORT_1 init_58_arg_1 = var_30; [L152] state_57 = init_58_arg_1 [L153] SORT_1 init_60_arg_1 = var_30; [L154] state_59 = init_60_arg_1 [L155] SORT_1 init_62_arg_1 = var_30; [L156] state_61 = init_62_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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L159] input_73 = __VERIFIER_nondet_uchar() [L160] EXPR input_73 & 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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L160] input_73 = input_73 & mask_SORT_1 [L161] input_75 = __VERIFIER_nondet_uchar() [L162] EXPR input_75 & mask_SORT_1 VAL [input_73=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L162] input_75 = input_75 & mask_SORT_1 [L163] input_79 = __VERIFIER_nondet_uchar() [L164] EXPR input_79 & mask_SORT_1 VAL [input_73=0, input_75=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L164] input_79 = input_79 & mask_SORT_1 [L165] input_80 = __VERIFIER_nondet_uchar() [L166] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L166] input_80 = input_80 & mask_SORT_1 [L167] input_84 = __VERIFIER_nondet_uchar() [L168] EXPR input_84 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L168] input_84 = input_84 & mask_SORT_1 [L169] input_85 = __VERIFIER_nondet_uchar() [L170] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L170] input_85 = input_85 & mask_SORT_1 [L171] input_89 = __VERIFIER_nondet_uchar() [L172] EXPR input_89 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L172] input_89 = input_89 & mask_SORT_1 [L173] input_96 = __VERIFIER_nondet_uchar() [L174] EXPR input_96 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L174] input_96 = input_96 & mask_SORT_1 [L175] input_102 = __VERIFIER_nondet_uchar() [L176] EXPR input_102 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L176] input_102 = input_102 & mask_SORT_1 [L177] input_132 = __VERIFIER_nondet_uchar() [L178] EXPR input_132 & mask_SORT_1 VAL [input_102=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L178] input_132 = input_132 & mask_SORT_1 [L179] input_135 = __VERIFIER_nondet_uchar() [L180] EXPR input_135 & mask_SORT_1 VAL [input_102=0, input_132=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L180] input_135 = input_135 & mask_SORT_1 [L181] input_139 = __VERIFIER_nondet_uchar() [L182] EXPR input_139 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L182] input_139 = input_139 & mask_SORT_1 [L183] input_146 = __VERIFIER_nondet_uchar() [L184] EXPR input_146 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L184] input_146 = input_146 & mask_SORT_1 [L185] input_149 = __VERIFIER_nondet_uchar() [L186] EXPR input_149 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L186] input_149 = input_149 & mask_SORT_1 [L187] input_153 = __VERIFIER_nondet_uchar() [L188] EXPR input_153 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L188] input_153 = input_153 & mask_SORT_1 [L189] input_160 = __VERIFIER_nondet_uchar() [L190] EXPR input_160 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L190] input_160 = input_160 & mask_SORT_1 [L191] input_163 = __VERIFIER_nondet_uchar() [L192] EXPR input_163 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L192] input_163 = input_163 & mask_SORT_1 [L193] input_167 = __VERIFIER_nondet_uchar() [L194] EXPR input_167 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L194] input_167 = input_167 & mask_SORT_1 [L195] input_177 = __VERIFIER_nondet_uchar() [L196] input_195 = __VERIFIER_nondet_uchar() [L197] input_213 = __VERIFIER_nondet_uchar() [L200] SORT_1 var_65_arg_0 = state_33; [L201] SORT_4 var_65_arg_1 = var_63; [L202] SORT_4 var_65_arg_2 = var_64; [L203] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L204] SORT_1 var_66_arg_0 = state_43; [L205] SORT_4 var_66_arg_1 = var_63; [L206] SORT_4 var_66_arg_2 = var_64; [L207] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L208] SORT_4 var_67_arg_0 = var_65; [L209] SORT_4 var_67_arg_1 = var_66; [L210] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L211] SORT_1 var_68_arg_0 = state_53; [L212] SORT_4 var_68_arg_1 = var_63; [L213] SORT_4 var_68_arg_2 = var_64; [L214] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L215] SORT_4 var_69_arg_0 = var_67; [L216] SORT_4 var_69_arg_1 = var_68; [L217] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_69=0, var_74=0, var_90=0, var_95=2] [L218] EXPR var_69 & mask_SORT_4 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L218] var_69 = var_69 & mask_SORT_4 [L219] SORT_4 var_70_arg_0 = var_69; [L220] SORT_4 var_70_arg_1 = var_63; [L221] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L222] SORT_1 var_71_arg_0 = ~state_61; VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_90=0, var_95=2] [L223] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_70=1, var_74=0, var_90=0, var_95=2] [L223] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L224] SORT_1 var_71_arg_1 = ~var_70; VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_90=0, var_95=2] [L225] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_90=0, var_95=2] [L225] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L226] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L226] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L227] EXPR var_71 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=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_31=0, state_33=0, state_35=0, state_37=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_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L227] var_71 = var_71 & mask_SORT_1 [L228] SORT_1 bad_72_arg_0 = var_71; [L229] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1670 locations, 2501 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9067 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9067 mSDsluCounter, 40974 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29496 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13622 IncrementalHoareTripleChecker+Invalid, 13624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 11478 mSDtfsCounter, 13622 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1760occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 2586 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 2879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-08 09:09:38,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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.peterson.2.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 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:09:40,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:09:40,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:09:40,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:09:40,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:09:40,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:09:40,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:09:40,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:09:40,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:09:40,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:09:40,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:09:40,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:09:40,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:09:40,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:09:40,552 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:09:40,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:09:40,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:09:40,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:09:40,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:09:40,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:09:40,554 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:09:40,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:09:40,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:09:40,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:09:40,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:09:40,555 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 -> 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 [2025-03-08 09:09:40,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:09:40,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:09:40,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:09:40,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:09:40,779 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:09:40,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2025-03-08 09:09:41,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b27a52f9/4c8e241aa8d94d73a42fd9aba8fadb08/FLAG99e62fd14 [2025-03-08 09:09:42,214 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:09:42,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2025-03-08 09:09:42,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b27a52f9/4c8e241aa8d94d73a42fd9aba8fadb08/FLAG99e62fd14 [2025-03-08 09:09:42,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b27a52f9/4c8e241aa8d94d73a42fd9aba8fadb08 [2025-03-08 09:09:42,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:09:42,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:09:42,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:09:42,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:09:42,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:09:42,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a6533c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42, skipping insertion in model container [2025-03-08 09:09:42,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:09:42,425 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.peterson.2.prop1-func-interl.c[1175,1188] [2025-03-08 09:09:42,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:09:42,594 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:09:42,606 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.peterson.2.prop1-func-interl.c[1175,1188] [2025-03-08 09:09:42,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:09:42,718 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:09:42,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42 WrapperNode [2025-03-08 09:09:42,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:09:42,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:09:42,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:09:42,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:09:42,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,803 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1538 [2025-03-08 09:09:42,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:09:42,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:09:42,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:09:42,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:09:42,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,855 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-08 09:09:42,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:09:42,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:09:42,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:09:42,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:09:42,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (1/1) ... [2025-03-08 09:09:42,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:09:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:09:42,937 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-08 09:09:42,940 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-08 09:09:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:09:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:09:42,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:09:42,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:09:43,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:09:43,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:09:44,247 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-08 09:09:44,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:09:44,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:09:44,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:09:44,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:44 BoogieIcfgContainer [2025-03-08 09:09:44,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:09:44,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:09:44,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:09:44,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:09:44,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:09:42" (1/3) ... [2025-03-08 09:09:44,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440e656d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:09:44, skipping insertion in model container [2025-03-08 09:09:44,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:09:42" (2/3) ... [2025-03-08 09:09:44,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440e656d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:09:44, skipping insertion in model container [2025-03-08 09:09:44,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:44" (3/3) ... [2025-03-08 09:09:44,265 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peterson.2.prop1-func-interl.c [2025-03-08 09:09:44,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:09:44,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.peterson.2.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:09:44,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:09:44,337 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;@7292ee5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:09:44,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:09:44,341 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-08 09:09:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:09:44,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:44,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:09:44,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:44,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:09:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:09:44,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714660254] [2025-03-08 09:09:44,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:44,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:09:44,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:09:44,364 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-08 09:09:44,366 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-08 09:09:44,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:09:44,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:09:44,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:44,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 09:09:44,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:09:44,890 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-08 09:09:44,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:09:44,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:09:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714660254] [2025-03-08 09:09:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714660254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:09:44,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:09:44,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:09:44,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272797697] [2025-03-08 09:09:44,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:09:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:09:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:09:44,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:09:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:09:44,913 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-08 09:09:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:09:45,028 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:09:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:09:45,031 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-08 09:09:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:09:45,035 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:09:45,035 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:09:45,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 09:09:45,039 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-08 09:09:45,040 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-08 09:09:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:09:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:09:45,058 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-08 09:09:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:09:45,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:09:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:09:45,061 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:09:45,061 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-08 09:09:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:09:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:09:45,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:09:45,062 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:09:45,070 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-08 09:09:45,262 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-08 09:09:45,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:09:45,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:09:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:09:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:09:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143088262] [2025-03-08 09:09:45,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:09:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:09:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:09:45,266 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-08 09:09:45,267 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-08 09:09:45,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:09:45,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:09:45,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:09:45,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:09:45,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 09:09:45,653 INFO L279 TraceCheckSpWp]: Computing forward predicates...