./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77ee3c12bce0e0c115e8aa14d1707fe352f16b7764cd43525551553c3df84286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:42:53,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:42:53,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:42:53,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:42:53,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:42:53,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:42:53,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:42:53,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:42:53,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:42:53,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:42:53,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:42:53,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:42:53,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:42:53,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:42:53,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:42:53,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:42:53,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:42:53,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:42:53,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:42:53,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:42:53,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:42:53,872 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 -> 77ee3c12bce0e0c115e8aa14d1707fe352f16b7764cd43525551553c3df84286 [2025-03-08 08:42:54,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:42:54,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:42:54,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:42:54,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:42:54,111 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:42:54,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.2.prop1-func-interl.c [2025-03-08 08:42:55,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd1da914/6d032e0bfd8d4da590b85f2f800f7eba/FLAG65a9e6904 [2025-03-08 08:42:55,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:42:55,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.2.prop1-func-interl.c [2025-03-08 08:42:55,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd1da914/6d032e0bfd8d4da590b85f2f800f7eba/FLAG65a9e6904 [2025-03-08 08:42:55,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd1da914/6d032e0bfd8d4da590b85f2f800f7eba [2025-03-08 08:42:55,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:42:55,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:42:55,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:42:55,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:42:55,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:42:55,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:42:55" (1/1) ... [2025-03-08 08:42:55,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331edf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:55, skipping insertion in model container [2025-03-08 08:42:55,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:42:55" (1/1) ... [2025-03-08 08:42:55,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:42:55,740 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.fischer.2.prop1-func-interl.c[1174,1187] [2025-03-08 08:42:56,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:42:56,042 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:42:56,049 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.fischer.2.prop1-func-interl.c[1174,1187] [2025-03-08 08:42:56,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:42:56,169 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:42:56,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56 WrapperNode [2025-03-08 08:42:56,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:42:56,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:42:56,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:42:56,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:42:56,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:56,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:56,592 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4955 [2025-03-08 08:42:56,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:42:56,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:42:56,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:42:56,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:42:56,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:56,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:56,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:56,851 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:42:56,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:56,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:57,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:57,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:57,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:57,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:57,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:42:57,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:42:57,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:42:57,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:42:57,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (1/1) ... [2025-03-08 08:42:57,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:42:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:42:57,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:42:57,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:42:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:42:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:42:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:42:57,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:42:57,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:42:57,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:43:01,752 INFO L? ?]: Removed 2786 outVars from TransFormulas that were not future-live. [2025-03-08 08:43:01,752 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:43:01,895 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:43:01,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:43:01,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:43:01 BoogieIcfgContainer [2025-03-08 08:43:01,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:43:01,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:43:01,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:43:01,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:43:01,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:42:55" (1/3) ... [2025-03-08 08:43:01,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d62acd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:43:01, skipping insertion in model container [2025-03-08 08:43:01,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:42:56" (2/3) ... [2025-03-08 08:43:01,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d62acd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:43:01, skipping insertion in model container [2025-03-08 08:43:01,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:43:01" (3/3) ... [2025-03-08 08:43:01,906 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.2.prop1-func-interl.c [2025-03-08 08:43:01,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:43:01,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.2.prop1-func-interl.c that has 1 procedures, 1738 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:43:01,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:43:02,002 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;@7519aee5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:43:02,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:43:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1736 states have (on average 1.5017281105990783) internal successors, (2607), 1737 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 08:43:02,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:02,017 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] [2025-03-08 08:43:02,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:02,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1604795431, now seen corresponding path program 1 times [2025-03-08 08:43:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:02,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229660031] [2025-03-08 08:43:02,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 08:43:02,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 08:43:02,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:02,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:02,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229660031] [2025-03-08 08:43:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229660031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:02,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:43:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146312629] [2025-03-08 08:43:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:02,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:43:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:02,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:43:02,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:02,863 INFO L87 Difference]: Start difference. First operand has 1738 states, 1736 states have (on average 1.5017281105990783) internal successors, (2607), 1737 states have internal predecessors, (2607), 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 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:03,704 INFO L93 Difference]: Finished difference Result 3381 states and 5075 transitions. [2025-03-08 08:43:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:43:03,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-03-08 08:43:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:03,724 INFO L225 Difference]: With dead ends: 3381 [2025-03-08 08:43:03,724 INFO L226 Difference]: Without dead ends: 1737 [2025-03-08 08:43:03,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:03,735 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 0 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6508 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:03,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6508 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:43:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-03-08 08:43:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1737. [2025-03-08 08:43:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1736 states have (on average 1.5005760368663594) internal successors, (2605), 1736 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2605 transitions. [2025-03-08 08:43:03,825 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2605 transitions. Word has length 95 [2025-03-08 08:43:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:03,825 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2605 transitions. [2025-03-08 08:43:03,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2605 transitions. [2025-03-08 08:43:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 08:43:03,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:03,827 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] [2025-03-08 08:43:03,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 08:43:03,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:03,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1795631047, now seen corresponding path program 1 times [2025-03-08 08:43:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626103866] [2025-03-08 08:43:03,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:03,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 08:43:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 08:43:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626103866] [2025-03-08 08:43:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626103866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:43:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119517351] [2025-03-08 08:43:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:43:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:04,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:43:04,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:04,072 INFO L87 Difference]: Start difference. First operand 1737 states and 2605 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:04,813 INFO L93 Difference]: Finished difference Result 3382 states and 5073 transitions. [2025-03-08 08:43:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:43:04,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-03-08 08:43:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:04,822 INFO L225 Difference]: With dead ends: 3382 [2025-03-08 08:43:04,823 INFO L226 Difference]: Without dead ends: 1739 [2025-03-08 08:43:04,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:04,827 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 0 mSDsluCounter, 4334 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6505 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:04,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6505 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:43:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-03-08 08:43:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1739. [2025-03-08 08:43:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.5) internal successors, (2607), 1738 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2607 transitions. [2025-03-08 08:43:04,853 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2607 transitions. Word has length 96 [2025-03-08 08:43:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:04,853 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2607 transitions. [2025-03-08 08:43:04,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2607 transitions. [2025-03-08 08:43:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 08:43:04,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:04,855 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] [2025-03-08 08:43:04,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:43:04,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:04,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1761499540, now seen corresponding path program 1 times [2025-03-08 08:43:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672376444] [2025-03-08 08:43:04,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:04,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 08:43:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 08:43:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:04,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672376444] [2025-03-08 08:43:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672376444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:43:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059210076] [2025-03-08 08:43:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:05,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:43:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:05,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:43:05,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:05,069 INFO L87 Difference]: Start difference. First operand 1739 states and 2607 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:05,733 INFO L93 Difference]: Finished difference Result 3390 states and 5083 transitions. [2025-03-08 08:43:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:43:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-03-08 08:43:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:05,740 INFO L225 Difference]: With dead ends: 3390 [2025-03-08 08:43:05,740 INFO L226 Difference]: Without dead ends: 1745 [2025-03-08 08:43:05,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:05,745 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 4 mSDsluCounter, 4329 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6500 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:05,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6500 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:43:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-03-08 08:43:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2025-03-08 08:43:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.499426605504587) internal successors, (2615), 1744 states have internal predecessors, (2615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2615 transitions. [2025-03-08 08:43:05,779 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2615 transitions. Word has length 97 [2025-03-08 08:43:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2615 transitions. [2025-03-08 08:43:05,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2615 transitions. [2025-03-08 08:43:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 08:43:05,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:05,785 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] [2025-03-08 08:43:05,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:43:05,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:05,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2145955953, now seen corresponding path program 1 times [2025-03-08 08:43:05,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:05,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131346900] [2025-03-08 08:43:05,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 08:43:05,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 08:43:05,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:05,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131346900] [2025-03-08 08:43:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131346900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:43:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837315058] [2025-03-08 08:43:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:05,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:43:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:05,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:43:05,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:43:05,999 INFO L87 Difference]: Start difference. First operand 1745 states and 2615 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:06,705 INFO L93 Difference]: Finished difference Result 3400 states and 5095 transitions. [2025-03-08 08:43:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:43:06,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-08 08:43:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:06,710 INFO L225 Difference]: With dead ends: 3400 [2025-03-08 08:43:06,711 INFO L226 Difference]: Without dead ends: 1749 [2025-03-08 08:43:06,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:43:06,713 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 0 mSDsluCounter, 4329 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6500 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:06,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6500 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:43:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-08 08:43:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1745. [2025-03-08 08:43:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.499426605504587) internal successors, (2615), 1744 states have internal predecessors, (2615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2615 transitions. [2025-03-08 08:43:06,778 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2615 transitions. Word has length 98 [2025-03-08 08:43:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:06,778 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2615 transitions. [2025-03-08 08:43:06,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2615 transitions. [2025-03-08 08:43:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 08:43:06,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:06,782 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] [2025-03-08 08:43:06,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:43:06,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:06,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash -306476977, now seen corresponding path program 1 times [2025-03-08 08:43:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109674109] [2025-03-08 08:43:06,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:06,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 08:43:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 08:43:06,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:06,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109674109] [2025-03-08 08:43:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109674109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:07,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:07,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:43:07,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004199356] [2025-03-08 08:43:07,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:07,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:43:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:07,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:43:07,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:43:07,046 INFO L87 Difference]: Start difference. First operand 1745 states and 2615 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:09,328 INFO L93 Difference]: Finished difference Result 5031 states and 7541 transitions. [2025-03-08 08:43:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:43:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2025-03-08 08:43:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:09,340 INFO L225 Difference]: With dead ends: 5031 [2025-03-08 08:43:09,340 INFO L226 Difference]: Without dead ends: 3380 [2025-03-08 08:43:09,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:43:09,345 INFO L435 NwaCegarLoop]: 1664 mSDtfsCounter, 2499 mSDsluCounter, 4910 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 6574 SdHoareTripleChecker+Invalid, 3700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:09,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 6574 Invalid, 3700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 08:43:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2025-03-08 08:43:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 1820. [2025-03-08 08:43:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1819 states have (on average 1.4986256184716877) internal successors, (2726), 1819 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2726 transitions. [2025-03-08 08:43:09,378 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2726 transitions. Word has length 99 [2025-03-08 08:43:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:09,378 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2726 transitions. [2025-03-08 08:43:09,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2726 transitions. [2025-03-08 08:43:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 08:43:09,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:09,379 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] [2025-03-08 08:43:09,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 08:43:09,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:09,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2025692455, now seen corresponding path program 1 times [2025-03-08 08:43:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117472781] [2025-03-08 08:43:09,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 08:43:09,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 08:43:09,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:09,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:09,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:09,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117472781] [2025-03-08 08:43:09,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117472781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:09,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:43:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405697962] [2025-03-08 08:43:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:43:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:09,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:43:09,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:43:09,952 INFO L87 Difference]: Start difference. First operand 1820 states and 2726 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:11,546 INFO L93 Difference]: Finished difference Result 3486 states and 5222 transitions. [2025-03-08 08:43:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:43:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 100 [2025-03-08 08:43:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:11,551 INFO L225 Difference]: With dead ends: 3486 [2025-03-08 08:43:11,551 INFO L226 Difference]: Without dead ends: 1835 [2025-03-08 08:43:11,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:43:11,553 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 2532 mSDsluCounter, 4938 mSDsCounter, 0 mSdLazyCounter, 3823 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2532 SdHoareTripleChecker+Valid, 6588 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:11,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2532 Valid, 6588 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3823 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 08:43:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-08 08:43:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2025-03-08 08:43:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1832 states have (on average 1.4961790393013101) internal successors, (2741), 1832 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2741 transitions. [2025-03-08 08:43:11,576 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2741 transitions. Word has length 100 [2025-03-08 08:43:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:11,577 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2741 transitions. [2025-03-08 08:43:11,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2741 transitions. [2025-03-08 08:43:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 08:43:11,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:11,578 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] [2025-03-08 08:43:11,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:43:11,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:11,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash 930635031, now seen corresponding path program 1 times [2025-03-08 08:43:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297086431] [2025-03-08 08:43:11,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 08:43:11,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 08:43:11,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:11,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:43:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297086431] [2025-03-08 08:43:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297086431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:43:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28205632] [2025-03-08 08:43:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:43:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:43:12,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:43:12,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:43:12,367 INFO L87 Difference]: Start difference. First operand 1833 states and 2741 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:13,459 INFO L93 Difference]: Finished difference Result 4700 states and 7034 transitions. [2025-03-08 08:43:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:43:13,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 101 [2025-03-08 08:43:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:13,470 INFO L225 Difference]: With dead ends: 4700 [2025-03-08 08:43:13,470 INFO L226 Difference]: Without dead ends: 3034 [2025-03-08 08:43:13,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:43:13,472 INFO L435 NwaCegarLoop]: 2156 mSDtfsCounter, 1966 mSDsluCounter, 6341 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 8497 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:13,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 8497 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 08:43:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2025-03-08 08:43:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 1828. [2025-03-08 08:43:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 1.4964422550629448) internal successors, (2734), 1827 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2734 transitions. [2025-03-08 08:43:13,505 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2734 transitions. Word has length 101 [2025-03-08 08:43:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:13,505 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2734 transitions. [2025-03-08 08:43:13,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2734 transitions. [2025-03-08 08:43:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 08:43:13,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:13,506 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] [2025-03-08 08:43:13,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 08:43:13,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:13,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1600123351, now seen corresponding path program 1 times [2025-03-08 08:43:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:43:13,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466429340] [2025-03-08 08:43:13,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:13,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:43:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 08:43:13,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 08:43:13,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:13,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:43:13,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 08:43:13,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 08:43:13,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 08:43:13,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:13,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:43:13,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 08:43:13,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 08:43:13,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 08:43:13,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 08:43:13,643 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:43:13,702 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 08:43:13,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 08:43:13,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 08:43:13 BoogieIcfgContainer [2025-03-08 08:43:13,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 08:43:13,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 08:43:13,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 08:43:13,725 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 08:43:13,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:43:01" (3/4) ... [2025-03-08 08:43:13,727 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 08:43:13,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 08:43:13,728 INFO L158 Benchmark]: Toolchain (without parser) took 18157.91ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 126.8MB in the beginning and 385.8MB in the end (delta: -259.1MB). Peak memory consumption was 177.7MB. Max. memory is 16.1GB. [2025-03-08 08:43:13,729 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:43:13,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.19ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 63.1MB in the end (delta: 63.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 08:43:13,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 421.94ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 63.1MB in the beginning and 52.2MB in the end (delta: 10.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-08 08:43:13,729 INFO L158 Benchmark]: Boogie Preprocessor took 605.67ms. Allocated memory was 176.2MB in the beginning and 427.8MB in the end (delta: 251.7MB). Free memory was 52.2MB in the beginning and 283.1MB in the end (delta: -230.9MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2025-03-08 08:43:13,730 INFO L158 Benchmark]: IcfgBuilder took 4698.84ms. Allocated memory is still 427.8MB. Free memory was 283.1MB in the beginning and 86.8MB in the end (delta: 196.3MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. [2025-03-08 08:43:13,730 INFO L158 Benchmark]: TraceAbstraction took 11823.15ms. Allocated memory was 427.8MB in the beginning and 604.0MB in the end (delta: 176.2MB). Free memory was 86.8MB in the beginning and 385.9MB in the end (delta: -299.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:43:13,730 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 604.0MB. Free memory was 385.9MB in the beginning and 385.8MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:43:13,731 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.36ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.19ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 63.1MB in the end (delta: 63.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 421.94ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 63.1MB in the beginning and 52.2MB in the end (delta: 10.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 605.67ms. Allocated memory was 176.2MB in the beginning and 427.8MB in the end (delta: 251.7MB). Free memory was 52.2MB in the beginning and 283.1MB in the end (delta: -230.9MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * IcfgBuilder took 4698.84ms. Allocated memory is still 427.8MB. Free memory was 283.1MB in the beginning and 86.8MB in the end (delta: 196.3MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11823.15ms. Allocated memory was 427.8MB in the beginning and 604.0MB in the end (delta: 176.2MB). Free memory was 86.8MB in the beginning and 385.9MB in the end (delta: -299.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 604.0MB. Free memory was 385.9MB in the beginning and 385.8MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 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_16 = 0; [L40] const SORT_4 var_53 = 1; [L41] const SORT_4 var_54 = 0; [L42] const SORT_2 var_66 = 0; [L43] const SORT_2 var_68 = 4; [L44] const SORT_2 var_71 = 3; [L45] const SORT_2 var_74 = 2; [L46] const SORT_2 var_77 = 1; [L47] const SORT_2 var_87 = 255; [L48] const SORT_3 var_91 = 0; [L49] const SORT_4 var_95 = 255; [L51] SORT_1 input_65; [L52] SORT_1 input_67; [L53] SORT_1 input_69; [L54] SORT_1 input_70; [L55] SORT_1 input_72; [L56] SORT_1 input_73; [L57] SORT_1 input_75; [L58] SORT_1 input_76; [L59] SORT_1 input_88; [L60] SORT_1 input_89; [L61] SORT_1 input_90; [L62] SORT_1 input_107; [L63] SORT_1 input_108; [L64] SORT_1 input_123; [L65] SORT_1 input_124; [L66] SORT_1 input_139; [L67] SORT_1 input_140; [L68] SORT_1 input_157; [L69] SORT_1 input_165; [L70] SORT_1 input_173; [L71] SORT_1 input_181; [L72] SORT_1 input_189; [L73] SORT_1 input_197; [L74] SORT_1 input_205; [L75] SORT_1 input_213; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L77] SORT_2 state_6 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L78] SORT_2 state_8 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L79] SORT_2 state_10 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L80] SORT_2 state_12 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L81] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L82] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L83] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L84] SORT_1 state_21 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L85] SORT_1 state_23 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L86] SORT_1 state_25 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L87] SORT_1 state_27 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L88] SORT_1 state_29 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L89] SORT_1 state_31 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L90] SORT_1 state_33 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L91] SORT_1 state_35 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L92] SORT_1 state_37 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L93] SORT_1 state_39 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L94] SORT_1 state_41 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L95] SORT_1 state_43 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L96] SORT_1 state_45 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L97] SORT_1 state_47 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L98] SORT_1 state_49 = __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_16=0, var_53=1, var_54=0, var_5=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L99] SORT_1 state_51 = __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_1 init_18_arg_1 = var_16; [L112] state_17 = init_18_arg_1 [L113] SORT_1 init_20_arg_1 = var_16; [L114] state_19 = init_20_arg_1 [L115] SORT_1 init_22_arg_1 = var_16; [L116] state_21 = init_22_arg_1 [L117] SORT_1 init_24_arg_1 = var_16; [L118] state_23 = init_24_arg_1 [L119] SORT_1 init_26_arg_1 = var_16; [L120] state_25 = init_26_arg_1 [L121] SORT_1 init_28_arg_1 = var_16; [L122] state_27 = init_28_arg_1 [L123] SORT_1 init_30_arg_1 = var_16; [L124] state_29 = init_30_arg_1 [L125] SORT_1 init_32_arg_1 = var_16; [L126] state_31 = init_32_arg_1 [L127] SORT_1 init_34_arg_1 = var_16; [L128] state_33 = init_34_arg_1 [L129] SORT_1 init_36_arg_1 = var_16; [L130] state_35 = init_36_arg_1 [L131] SORT_1 init_38_arg_1 = var_16; [L132] state_37 = init_38_arg_1 [L133] SORT_1 init_40_arg_1 = var_16; [L134] state_39 = init_40_arg_1 [L135] SORT_1 init_42_arg_1 = var_16; [L136] state_41 = init_42_arg_1 [L137] SORT_1 init_44_arg_1 = var_16; [L138] state_43 = init_44_arg_1 [L139] SORT_1 init_46_arg_1 = var_16; [L140] state_45 = init_46_arg_1 [L141] SORT_1 init_48_arg_1 = var_16; [L142] state_47 = init_48_arg_1 [L143] SORT_1 init_50_arg_1 = var_16; [L144] state_49 = init_50_arg_1 [L145] SORT_1 init_52_arg_1 = var_16; [L146] state_51 = init_52_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_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L149] input_65 = __VERIFIER_nondet_uchar() [L150] EXPR input_65 & 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_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L150] input_65 = input_65 & mask_SORT_1 [L151] input_67 = __VERIFIER_nondet_uchar() [L152] EXPR input_67 & mask_SORT_1 VAL [input_65=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L152] input_67 = input_67 & mask_SORT_1 [L153] input_69 = __VERIFIER_nondet_uchar() [L154] EXPR input_69 & mask_SORT_1 VAL [input_65=0, input_67=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L154] input_69 = input_69 & mask_SORT_1 [L155] input_70 = __VERIFIER_nondet_uchar() [L156] EXPR input_70 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L156] input_70 = input_70 & mask_SORT_1 [L157] input_72 = __VERIFIER_nondet_uchar() [L158] EXPR input_72 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L158] input_72 = input_72 & mask_SORT_1 [L159] input_73 = __VERIFIER_nondet_uchar() [L160] EXPR input_73 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L160] input_73 = input_73 & mask_SORT_1 [L161] input_75 = __VERIFIER_nondet_uchar() [L162] EXPR input_75 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, 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_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L162] input_75 = input_75 & mask_SORT_1 [L163] input_76 = __VERIFIER_nondet_uchar() [L164] EXPR input_76 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, 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_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L164] input_76 = input_76 & mask_SORT_1 [L165] input_88 = __VERIFIER_nondet_uchar() [L166] EXPR input_88 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L166] input_88 = input_88 & mask_SORT_1 [L167] input_89 = __VERIFIER_nondet_uchar() [L168] EXPR input_89 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L168] input_89 = input_89 & mask_SORT_1 [L169] input_90 = __VERIFIER_nondet_uchar() [L170] EXPR input_90 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=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_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L170] input_90 = input_90 & mask_SORT_1 [L171] input_107 = __VERIFIER_nondet_uchar() [L172] EXPR input_107 & mask_SORT_1 VAL [input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L172] input_107 = input_107 & mask_SORT_1 [L173] input_108 = __VERIFIER_nondet_uchar() [L174] EXPR input_108 & mask_SORT_1 VAL [input_107=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L174] input_108 = input_108 & mask_SORT_1 [L175] input_123 = __VERIFIER_nondet_uchar() [L176] EXPR input_123 & mask_SORT_1 VAL [input_107=0, input_108=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L176] input_123 = input_123 & mask_SORT_1 [L177] input_124 = __VERIFIER_nondet_uchar() [L178] EXPR input_124 & mask_SORT_1 VAL [input_107=0, input_108=0, input_123=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L178] input_124 = input_124 & mask_SORT_1 [L179] input_139 = __VERIFIER_nondet_uchar() [L180] EXPR input_139 & mask_SORT_1 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L180] input_139 = input_139 & mask_SORT_1 [L181] input_140 = __VERIFIER_nondet_uchar() [L182] EXPR input_140 & mask_SORT_1 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L182] input_140 = input_140 & mask_SORT_1 [L183] input_157 = __VERIFIER_nondet_uchar() [L184] input_165 = __VERIFIER_nondet_uchar() [L185] input_173 = __VERIFIER_nondet_uchar() [L186] input_181 = __VERIFIER_nondet_uchar() [L187] input_189 = __VERIFIER_nondet_uchar() [L188] input_197 = __VERIFIER_nondet_uchar() [L189] input_205 = __VERIFIER_nondet_uchar() [L190] input_213 = __VERIFIER_nondet_uchar() [L193] SORT_1 var_55_arg_0 = state_25; [L194] SORT_4 var_55_arg_1 = var_53; [L195] SORT_4 var_55_arg_2 = var_54; [L196] SORT_4 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L197] SORT_1 var_56_arg_0 = state_33; [L198] SORT_4 var_56_arg_1 = var_53; [L199] SORT_4 var_56_arg_2 = var_54; [L200] SORT_4 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L201] SORT_4 var_57_arg_0 = var_55; [L202] SORT_4 var_57_arg_1 = var_56; [L203] SORT_4 var_57 = var_57_arg_0 + var_57_arg_1; [L204] SORT_1 var_58_arg_0 = state_41; [L205] SORT_4 var_58_arg_1 = var_53; [L206] SORT_4 var_58_arg_2 = var_54; [L207] SORT_4 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L208] SORT_4 var_59_arg_0 = var_57; [L209] SORT_4 var_59_arg_1 = var_58; [L210] SORT_4 var_59 = var_59_arg_0 + var_59_arg_1; [L211] SORT_1 var_60_arg_0 = state_49; [L212] SORT_4 var_60_arg_1 = var_53; [L213] SORT_4 var_60_arg_2 = var_54; [L214] SORT_4 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L215] SORT_4 var_61_arg_0 = var_59; [L216] SORT_4 var_61_arg_1 = var_60; [L217] SORT_4 var_61 = var_61_arg_0 + var_61_arg_1; VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_61=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L218] EXPR var_61 & mask_SORT_4 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L218] var_61 = var_61 & mask_SORT_4 [L219] SORT_4 var_62_arg_0 = var_61; [L220] SORT_4 var_62_arg_1 = var_53; [L221] SORT_1 var_62 = var_62_arg_0 <= var_62_arg_1; [L222] SORT_1 var_63_arg_0 = ~state_51; VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_62=1, var_63_arg_0=-1, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L223] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_62=1, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L223] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L224] SORT_1 var_63_arg_1 = ~var_62; VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_63_arg_0=1, var_63_arg_1=-2, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L225] EXPR var_63_arg_1 & mask_SORT_1 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_63_arg_0=1, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L225] var_63_arg_1 = var_63_arg_1 & mask_SORT_1 [L226] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L226] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L227] EXPR var_63 & mask_SORT_1 VAL [input_107=0, input_108=0, input_123=0, input_124=0, input_139=0, input_140=0, input_65=0, input_67=0, input_69=0, input_70=0, input_72=0, input_73=0, input_75=0, input_76=0, input_88=0, input_89=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_53=1, var_54=0, var_66=0, var_68=4, var_71=3, var_74=2, var_77=1, var_87=255, var_91=0, var_95=255] [L227] var_63 = var_63 & mask_SORT_1 [L228] SORT_1 bad_64_arg_0 = var_63; [L229] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1738 locations, 2607 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7001 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7001 mSDsluCounter, 47672 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33518 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14518 IncrementalHoareTripleChecker+Invalid, 14521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 14154 mSDtfsCounter, 14518 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1833occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 2772 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 679 ConstructedInterpolants, 0 QuantifiedInterpolants, 2574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 08:43:13,772 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.fischer.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77ee3c12bce0e0c115e8aa14d1707fe352f16b7764cd43525551553c3df84286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:43:15,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:43:15,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 08:43:15,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:43:15,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:43:15,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:43:15,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:43:15,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:43:15,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:43:15,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:43:15,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:43:15,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:43:15,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:43:15,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:43:15,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:43:15,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:43:15,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:43:15,703 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 -> 77ee3c12bce0e0c115e8aa14d1707fe352f16b7764cd43525551553c3df84286 [2025-03-08 08:43:15,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:43:15,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:43:15,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:43:15,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:43:15,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:43:15,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.2.prop1-func-interl.c [2025-03-08 08:43:17,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145fe3f8b/411cd033fd2c45a5ab993b682bf1ffa2/FLAG8e64b32f8 [2025-03-08 08:43:17,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:43:17,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.2.prop1-func-interl.c [2025-03-08 08:43:17,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145fe3f8b/411cd033fd2c45a5ab993b682bf1ffa2/FLAG8e64b32f8 [2025-03-08 08:43:17,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145fe3f8b/411cd033fd2c45a5ab993b682bf1ffa2 [2025-03-08 08:43:17,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:43:17,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:43:17,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:43:17,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:43:17,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:43:17,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:43:17" (1/1) ... [2025-03-08 08:43:17,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38de72cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:17, skipping insertion in model container [2025-03-08 08:43:17,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:43:17" (1/1) ... [2025-03-08 08:43:17,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:43:17,628 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.fischer.2.prop1-func-interl.c[1174,1187] [2025-03-08 08:43:17,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:43:17,905 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:43:17,911 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.fischer.2.prop1-func-interl.c[1174,1187] [2025-03-08 08:43:18,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:43:18,035 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:43:18,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18 WrapperNode [2025-03-08 08:43:18,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:43:18,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:43:18,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:43:18,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:43:18,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,119 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1499 [2025-03-08 08:43:18,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:43:18,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:43:18,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:43:18,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:43:18,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:43:18,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:43:18,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:43:18,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:43:18,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:43:18,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (1/1) ... [2025-03-08 08:43:18,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:43:18,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:43:18,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:43:18,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:43:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:43:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 08:43:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:43:18,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:43:18,528 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:43:18,530 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:43:19,494 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-08 08:43:19,494 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:43:19,500 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:43:19,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:43:19,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:43:19 BoogieIcfgContainer [2025-03-08 08:43:19,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:43:19,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:43:19,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:43:19,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:43:19,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:43:17" (1/3) ... [2025-03-08 08:43:19,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64951b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:43:19, skipping insertion in model container [2025-03-08 08:43:19,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:43:18" (2/3) ... [2025-03-08 08:43:19,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64951b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:43:19, skipping insertion in model container [2025-03-08 08:43:19,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:43:19" (3/3) ... [2025-03-08 08:43:19,509 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.2.prop1-func-interl.c [2025-03-08 08:43:19,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:43:19,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.2.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:43:19,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:43:19,562 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;@677ba76f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:43:19,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:43:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 08:43:19,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:19,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 08:43:19,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 08:43:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:43:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221232520] [2025-03-08 08:43:19,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:43:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:43:19,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:43:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:43:19,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 08:43:19,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 08:43:19,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:19,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:19,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 08:43:19,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:43:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:43:20,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:43:20,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:43:20,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221232520] [2025-03-08 08:43:20,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221232520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:43:20,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:43:20,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:43:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752970285] [2025-03-08 08:43:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:43:20,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:43:20,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:43:20,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:43:20,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:43:20,204 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:43:20,325 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 08:43:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:43:20,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 08:43:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:43:20,332 INFO L225 Difference]: With dead ends: 18 [2025-03-08 08:43:20,332 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 08:43:20,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:43:20,337 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:43:20,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:43:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 08:43:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 08:43:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 08:43:20,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 08:43:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:43:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 08:43:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:43:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 08:43:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 08:43:20,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:43:20,362 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 08:43:20,372 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-08 08:43:20,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:43:20,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:43:20,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:43:20,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 08:43:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:43:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132234791] [2025-03-08 08:43:20,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:43:20,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:43:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:43:20,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:43:20,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 08:43:20,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 08:43:20,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 08:43:20,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:43:20,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:43:20,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 08:43:20,975 INFO L279 TraceCheckSpWp]: Computing forward predicates...