./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.1.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 f481769c8ee6b54a84b116cdfd2e04c322c41f9346b556bba03adf12ced69f52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:57:37,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:57:37,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:57:37,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:57:37,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:57:37,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:57:37,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:57:37,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:57:37,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:57:37,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:57:37,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:57:37,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:57:37,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:57:37,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:57:37,536 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:57:37,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:57:37,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:57:37,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:57:37,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:57:37,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:57:37,538 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 -> f481769c8ee6b54a84b116cdfd2e04c322c41f9346b556bba03adf12ced69f52 [2025-03-03 17:57:37,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:57:37,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:57:37,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:57:37,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:57:37,811 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:57:37,813 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.1.prop1-func-interl.c [2025-03-03 17:57:39,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d371be67/270a227270b14a5f8c0c5381eb4e6965/FLAGa2e5dd292 [2025-03-03 17:57:39,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:57:39,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.1.prop1-func-interl.c [2025-03-03 17:57:39,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d371be67/270a227270b14a5f8c0c5381eb4e6965/FLAGa2e5dd292 [2025-03-03 17:57:40,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d371be67/270a227270b14a5f8c0c5381eb4e6965 [2025-03-03 17:57:40,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:57:40,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:57:40,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:57:40,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:57:40,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:57:40,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:40,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5148fa7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40, skipping insertion in model container [2025-03-03 17:57:40,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:40,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:57:40,397 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.1.prop1-func-interl.c[1175,1188] [2025-03-03 17:57:40,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:57:40,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:57:40,670 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.1.prop1-func-interl.c[1175,1188] [2025-03-03 17:57:40,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:57:40,795 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:57:40,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40 WrapperNode [2025-03-03 17:57:40,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:57:40,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:57:40,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:57:40,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:57:40,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:40,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,180 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4885 [2025-03-03 17:57:41,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:57:41,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:57:41,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:57:41,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:57:41,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,399 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:57:41,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:57:41,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:57:41,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:57:41,654 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:57:41,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (1/1) ... [2025-03-03 17:57:41,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:57:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:57:41,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:57:41,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:57:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:57:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:57:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:57:41,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:57:41,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:57:41,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:57:45,860 INFO L? ?]: Removed 2720 outVars from TransFormulas that were not future-live. [2025-03-03 17:57:45,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:57:46,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:57:46,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:57:46,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:57:46 BoogieIcfgContainer [2025-03-03 17:57:46,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:57:46,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:57:46,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:57:46,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:57:46,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:57:40" (1/3) ... [2025-03-03 17:57:46,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2737d1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:57:46, skipping insertion in model container [2025-03-03 17:57:46,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:57:40" (2/3) ... [2025-03-03 17:57:46,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2737d1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:57:46, skipping insertion in model container [2025-03-03 17:57:46,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:57:46" (3/3) ... [2025-03-03 17:57:46,025 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peterson.1.prop1-func-interl.c [2025-03-03 17:57:46,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:57:46,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.peterson.1.prop1-func-interl.c that has 1 procedures, 1682 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:57:46,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:57:46,129 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;@f759183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:57:46,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:57:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 1682 states, 1680 states have (on average 1.499404761904762) internal successors, (2519), 1681 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 17:57:46,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:46,149 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-03 17:57:46,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:46,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1534624054, now seen corresponding path program 1 times [2025-03-03 17:57:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347144271] [2025-03-03 17:57:46,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:46,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 17:57:46,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 17:57:46,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:46,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:57:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:57:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:57:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347144271] [2025-03-03 17:57:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347144271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:57:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:57:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:57:47,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671403722] [2025-03-03 17:57:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:57:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:57:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:57:47,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:57:47,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:57:47,087 INFO L87 Difference]: Start difference. First operand has 1682 states, 1680 states have (on average 1.499404761904762) internal successors, (2519), 1681 states have internal predecessors, (2519), 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-03 17:57:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:57:49,442 INFO L93 Difference]: Finished difference Result 4800 states and 7195 transitions. [2025-03-03 17:57:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:57:49,444 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-03 17:57:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:57:49,462 INFO L225 Difference]: With dead ends: 4800 [2025-03-03 17:57:49,463 INFO L226 Difference]: Without dead ends: 3232 [2025-03-03 17:57:49,471 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-03 17:57:49,473 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 2400 mSDsluCounter, 4709 mSDsCounter, 0 mSdLazyCounter, 3574 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 6317 SdHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:57:49,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 6317 Invalid, 3575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3574 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 17:57:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-03-03 17:57:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1758. [2025-03-03 17:57:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1757 states have (on average 1.49800796812749) internal successors, (2632), 1757 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2632 transitions. [2025-03-03 17:57:49,578 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2632 transitions. Word has length 107 [2025-03-03 17:57:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:57:49,579 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2632 transitions. [2025-03-03 17:57:49,579 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-03 17:57:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2632 transitions. [2025-03-03 17:57:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 17:57:49,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:49,582 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-03 17:57:49,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:57:49,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:49,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash 61388079, now seen corresponding path program 1 times [2025-03-03 17:57:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738763260] [2025-03-03 17:57:49,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:49,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:49,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 17:57:49,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 17:57:49,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:57:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:57:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:57:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738763260] [2025-03-03 17:57:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738763260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:57:49,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:57:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:57:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419568846] [2025-03-03 17:57:49,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:57:49,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:57:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:57:49,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:57:49,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:57:49,867 INFO L87 Difference]: Start difference. First operand 1758 states and 2632 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-03 17:57:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:57:50,481 INFO L93 Difference]: Finished difference Result 1762 states and 2636 transitions. [2025-03-03 17:57:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:57:50,481 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-03 17:57:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:57:50,486 INFO L225 Difference]: With dead ends: 1762 [2025-03-03 17:57:50,486 INFO L226 Difference]: Without dead ends: 1760 [2025-03-03 17:57:50,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:57:50,487 INFO L435 NwaCegarLoop]: 2095 mSDtfsCounter, 0 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6280 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:57:50,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6280 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:57:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-03 17:57:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2025-03-03 17:57:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1759 states have (on average 1.4974417282546901) internal successors, (2634), 1759 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2634 transitions. [2025-03-03 17:57:50,511 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2634 transitions. Word has length 109 [2025-03-03 17:57:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:57:50,512 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2634 transitions. [2025-03-03 17:57:50,512 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-03 17:57:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2634 transitions. [2025-03-03 17:57:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 17:57:50,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:50,513 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-03 17:57:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:57:50,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1907712163, now seen corresponding path program 1 times [2025-03-03 17:57:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917306235] [2025-03-03 17:57:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:50,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 17:57:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 17:57:50,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:50,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:57:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:57:50,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:57:50,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917306235] [2025-03-03 17:57:50,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917306235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:57:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:57:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:57:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024701776] [2025-03-03 17:57:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:57:50,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:57:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:57:50,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:57:50,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:57:50,709 INFO L87 Difference]: Start difference. First operand 1760 states and 2634 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-03 17:57:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:57:51,304 INFO L93 Difference]: Finished difference Result 3329 states and 4984 transitions. [2025-03-03 17:57:51,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:57:51,304 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-03 17:57:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:57:51,309 INFO L225 Difference]: With dead ends: 3329 [2025-03-03 17:57:51,309 INFO L226 Difference]: Without dead ends: 1762 [2025-03-03 17:57:51,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:57:51,311 INFO L435 NwaCegarLoop]: 2095 mSDtfsCounter, 0 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6277 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:57:51,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6277 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:57:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-03 17:57:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2025-03-03 17:57:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1761 states have (on average 1.4968767745599092) internal successors, (2636), 1761 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2636 transitions. [2025-03-03 17:57:51,335 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2636 transitions. Word has length 110 [2025-03-03 17:57:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:57:51,336 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2636 transitions. [2025-03-03 17:57:51,336 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-03 17:57:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2636 transitions. [2025-03-03 17:57:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 17:57:51,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:51,337 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-03 17:57:51,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:57:51,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:51,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 941046698, now seen corresponding path program 1 times [2025-03-03 17:57:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:51,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467689961] [2025-03-03 17:57:51,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:51,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 17:57:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 17:57:51,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:51,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:57:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:57:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:57:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467689961] [2025-03-03 17:57:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467689961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:57:51,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:57:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:57:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068479634] [2025-03-03 17:57:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:57:51,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:57:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:57:51,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:57:51,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:57:51,726 INFO L87 Difference]: Start difference. First operand 1762 states and 2636 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-03 17:57:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:57:53,364 INFO L93 Difference]: Finished difference Result 3343 states and 5001 transitions. [2025-03-03 17:57:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:57:53,364 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-03 17:57:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:57:53,371 INFO L225 Difference]: With dead ends: 3343 [2025-03-03 17:57:53,372 INFO L226 Difference]: Without dead ends: 1774 [2025-03-03 17:57:53,373 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-03 17:57:53,374 INFO L435 NwaCegarLoop]: 2077 mSDtfsCounter, 2434 mSDsluCounter, 7314 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 9391 SdHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:57:53,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 9391 Invalid, 3184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 17:57:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-03 17:57:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1771. [2025-03-03 17:57:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1770 states have (on average 1.4954802259887006) internal successors, (2647), 1770 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2647 transitions. [2025-03-03 17:57:53,406 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2647 transitions. Word has length 111 [2025-03-03 17:57:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:57:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2647 transitions. [2025-03-03 17:57:53,407 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-03 17:57:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2647 transitions. [2025-03-03 17:57:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 17:57:53,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:53,408 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-03 17:57:53,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:57:53,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:53,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 120735236, now seen corresponding path program 1 times [2025-03-03 17:57:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384477494] [2025-03-03 17:57:53,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:53,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:53,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 17:57:53,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 17:57:53,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:53,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:57:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:57:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:57:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384477494] [2025-03-03 17:57:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384477494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:57:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:57:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:57:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844791468] [2025-03-03 17:57:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:57:54,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:57:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:57:54,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:57:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:57:54,075 INFO L87 Difference]: Start difference. First operand 1771 states and 2647 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-03 17:57:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:57:55,094 INFO L93 Difference]: Finished difference Result 4476 states and 6693 transitions. [2025-03-03 17:57:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:57:55,094 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-03 17:57:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:57:55,102 INFO L225 Difference]: With dead ends: 4476 [2025-03-03 17:57:55,102 INFO L226 Difference]: Without dead ends: 2896 [2025-03-03 17:57:55,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:57:55,105 INFO L435 NwaCegarLoop]: 2083 mSDtfsCounter, 1873 mSDsluCounter, 6099 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 8182 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:57:55,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 8182 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:57:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2025-03-03 17:57:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1766. [2025-03-03 17:57:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 1.4957507082152974) internal successors, (2640), 1765 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2640 transitions. [2025-03-03 17:57:55,133 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2640 transitions. Word has length 112 [2025-03-03 17:57:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:57:55,133 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2640 transitions. [2025-03-03 17:57:55,133 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-03 17:57:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2640 transitions. [2025-03-03 17:57:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 17:57:55,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:55,135 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-03 17:57:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:57:55,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 996041640, now seen corresponding path program 1 times [2025-03-03 17:57:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688760902] [2025-03-03 17:57:55,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:55,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 17:57:55,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 17:57:55,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:55,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:57:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:57:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:57:55,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688760902] [2025-03-03 17:57:55,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688760902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:57:55,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:57:55,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:57:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148398084] [2025-03-03 17:57:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:57:55,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:57:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:57:55,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:57:55,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:57:55,466 INFO L87 Difference]: Start difference. First operand 1766 states and 2640 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-03 17:57:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:57:57,039 INFO L93 Difference]: Finished difference Result 3345 states and 5003 transitions. [2025-03-03 17:57:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:57:57,039 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-03 17:57:57,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:57:57,044 INFO L225 Difference]: With dead ends: 3345 [2025-03-03 17:57:57,044 INFO L226 Difference]: Without dead ends: 1770 [2025-03-03 17:57:57,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:57:57,047 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 2432 mSDsluCounter, 4746 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 6332 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:57:57,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 6332 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3727 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 17:57:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-03 17:57:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1767. [2025-03-03 17:57:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1766 states have (on average 1.4954699886749716) internal successors, (2641), 1766 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:57:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2641 transitions. [2025-03-03 17:57:57,070 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2641 transitions. Word has length 112 [2025-03-03 17:57:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:57:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2641 transitions. [2025-03-03 17:57:57,071 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-03 17:57:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2641 transitions. [2025-03-03 17:57:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 17:57:57,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:57:57,071 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-03 17:57:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:57:57,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:57:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:57:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1457963412, now seen corresponding path program 1 times [2025-03-03 17:57:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:57:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341043254] [2025-03-03 17:57:57,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:57:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:57:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 17:57:57,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 17:57:57,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:57:57,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:57:57,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 17:57:57,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 17:57:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:57:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:57:57,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:57:57,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:57:57,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:57:57,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:57:57,209 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:57:57,270 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:57:57,287 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:57:57,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:57:57 BoogieIcfgContainer [2025-03-03 17:57:57,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:57:57,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:57:57,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:57:57,292 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:57:57,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:57:46" (3/4) ... [2025-03-03 17:57:57,294 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:57:57,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:57:57,295 INFO L158 Benchmark]: Toolchain (without parser) took 17068.07ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 127.7MB in the beginning and 431.9MB in the end (delta: -304.2MB). Peak memory consumption was 574.1MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,296 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:57:57,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.25ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 63.8MB in the end (delta: 63.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 383.51ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 63.8MB in the beginning and 335.3MB in the end (delta: -271.5MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,296 INFO L158 Benchmark]: Boogie Preprocessor took 470.85ms. Allocated memory is still 453.0MB. Free memory was 335.3MB in the beginning and 323.2MB in the end (delta: 12.1MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,297 INFO L158 Benchmark]: IcfgBuilder took 4364.66ms. Allocated memory was 453.0MB in the beginning and 1.0GB in the end (delta: 587.2MB). Free memory was 323.2MB in the beginning and 583.1MB in the end (delta: -259.8MB). Peak memory consumption was 337.9MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,297 INFO L158 Benchmark]: TraceAbstraction took 11272.63ms. Allocated memory is still 1.0GB. Free memory was 578.9MB in the beginning and 432.1MB in the end (delta: 146.8MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,297 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 1.0GB. Free memory was 432.1MB in the beginning and 431.9MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:57:57,298 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.40ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.25ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 63.8MB in the end (delta: 63.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 383.51ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 63.8MB in the beginning and 335.3MB in the end (delta: -271.5MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 470.85ms. Allocated memory is still 453.0MB. Free memory was 335.3MB in the beginning and 323.2MB in the end (delta: 12.1MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4364.66ms. Allocated memory was 453.0MB in the beginning and 1.0GB in the end (delta: 587.2MB). Free memory was 323.2MB in the beginning and 583.1MB in the end (delta: -259.8MB). Peak memory consumption was 337.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11272.63ms. Allocated memory is still 1.0GB. Free memory was 578.9MB in the beginning and 432.1MB in the end (delta: 146.8MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 1.0GB. Free memory was 432.1MB in the beginning and 431.9MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 223, overapproximation of bitwiseAnd at line 225. 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, 1682 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9139 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9139 mSDsluCounter, 42779 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31235 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14725 IncrementalHoareTripleChecker+Invalid, 14727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 11544 mSDtfsCounter, 14725 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=1771occurred in iteration=4, 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 2610 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s 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-03 17:57:57,317 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.1.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 f481769c8ee6b54a84b116cdfd2e04c322c41f9346b556bba03adf12ced69f52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:57:59,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:57:59,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:57:59,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:57:59,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:57:59,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:57:59,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:57:59,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:57:59,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:57:59,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:57:59,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:57:59,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:57:59,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:57:59,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:57:59,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:57:59,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:57:59,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:57:59,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:57:59,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:57:59,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:57:59,317 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 -> f481769c8ee6b54a84b116cdfd2e04c322c41f9346b556bba03adf12ced69f52 [2025-03-03 17:57:59,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:57:59,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:57:59,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:57:59,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:57:59,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:57:59,552 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.1.prop1-func-interl.c [2025-03-03 17:58:00,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32cd07b1/782352dd53564b94850b4dadf17e1066/FLAG390ba761d [2025-03-03 17:58:00,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:58:00,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.1.prop1-func-interl.c [2025-03-03 17:58:00,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32cd07b1/782352dd53564b94850b4dadf17e1066/FLAG390ba761d [2025-03-03 17:58:01,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32cd07b1/782352dd53564b94850b4dadf17e1066 [2025-03-03 17:58:01,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:58:01,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:58:01,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:58:01,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:58:01,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:58:01,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5705e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01, skipping insertion in model container [2025-03-03 17:58:01,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:58:01,405 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.1.prop1-func-interl.c[1175,1188] [2025-03-03 17:58:01,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:58:01,587 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:58:01,595 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.1.prop1-func-interl.c[1175,1188] [2025-03-03 17:58:01,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:58:01,701 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:58:01,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01 WrapperNode [2025-03-03 17:58:01,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:58:01,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:58:01,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:58:01,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:58:01,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,788 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1541 [2025-03-03 17:58:01,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:58:01,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:58:01,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:58:01,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:58:01,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:58:01,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:58:01,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:58:01,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:58:01,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:58:01,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (1/1) ... [2025-03-03 17:58:01,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:58:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:58:01,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:58:01,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:58:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:58:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:58:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:58:01,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:58:02,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:58:02,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:58:03,236 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-03 17:58:03,236 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:58:03,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:58:03,243 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:58:03,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:58:03 BoogieIcfgContainer [2025-03-03 17:58:03,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:58:03,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:58:03,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:58:03,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:58:03,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:58:01" (1/3) ... [2025-03-03 17:58:03,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fd46f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:58:03, skipping insertion in model container [2025-03-03 17:58:03,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:58:01" (2/3) ... [2025-03-03 17:58:03,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fd46f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:58:03, skipping insertion in model container [2025-03-03 17:58:03,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:58:03" (3/3) ... [2025-03-03 17:58:03,252 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peterson.1.prop1-func-interl.c [2025-03-03 17:58:03,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:58:03,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.peterson.1.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:58:03,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:58:03,309 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e096f39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:58:03,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:58:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:58:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:58:03,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:58:03,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:58:03,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:58:03,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:58:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:58:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:58:03,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346640534] [2025-03-03 17:58:03,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:58:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:58:03,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:58:03,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:58:03,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:58:03,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:58:03,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:58:03,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:58:03,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:58:03,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 17:58:03,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:58:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:58:03,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:58:03,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:58:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346640534] [2025-03-03 17:58:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346640534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:58:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:58:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:58:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777276904] [2025-03-03 17:58:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:58:03,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:58:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:58:03,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:58:03,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:58:03,887 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:58:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:58:04,022 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:58:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:58:04,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:58:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:58:04,031 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:58:04,031 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:58:04,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:58:04,036 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:58:04,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:58:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:58:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:58:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:58:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:58:04,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:58:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:58:04,060 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:58:04,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-03 17:58:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:58:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:58:04,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:58:04,061 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:58:04,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:58:04,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-03 17:58:04,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:58:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:58:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:58:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:58:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342693492] [2025-03-03 17:58:04,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:58:04,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:58:04,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:58:04,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:58:04,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:58:04,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:58:04,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:58:04,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:58:04,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:58:04,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 17:58:04,680 INFO L279 TraceCheckSpWp]: Computing forward predicates...