./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/eca-rers2012/Problem03_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 9eb211dff2d7d24fbef4856e0a2f1ba2134136f04d84e12518dc8b67ba1dd611 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:09:07,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:09:07,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:09:07,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:09:07,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:09:07,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:09:07,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:09:07,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:09:07,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:09:07,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:09:07,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:09:07,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:09:07,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:09:07,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:09:07,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:09:07,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:09:07,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:09:07,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:09:07,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:09:07,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:09:07,906 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9eb211dff2d7d24fbef4856e0a2f1ba2134136f04d84e12518dc8b67ba1dd611 [2025-03-16 14:09:08,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:09:08,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:09:08,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:09:08,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:09:08,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:09:08,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label05.c [2025-03-16 14:09:09,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4438fa0/4c414bbe7361469aa14c2f5d40ea504e/FLAG0b3ffdb56 [2025-03-16 14:09:09,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:09:09,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label05.c [2025-03-16 14:09:09,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4438fa0/4c414bbe7361469aa14c2f5d40ea504e/FLAG0b3ffdb56 [2025-03-16 14:09:09,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4438fa0/4c414bbe7361469aa14c2f5d40ea504e [2025-03-16 14:09:09,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:09:09,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:09:09,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:09:09,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:09:09,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:09:09,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548b6d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09, skipping insertion in model container [2025-03-16 14:09:09,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:09:10,241 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/eca-rers2012/Problem03_label05.c[55544,55557] [2025-03-16 14:09:10,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:09:10,281 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:09:10,402 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/eca-rers2012/Problem03_label05.c[55544,55557] [2025-03-16 14:09:10,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:09:10,435 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:09:10,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10 WrapperNode [2025-03-16 14:09:10,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:09:10,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:09:10,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:09:10,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:09:10,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,551 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:09:10,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:09:10,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:09:10,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:09:10,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:09:10,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,602 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-16 14:09:10,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:09:10,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:09:10,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:09:10,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:09:10,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (1/1) ... [2025-03-16 14:09:10,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:09:10,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:10,700 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-16 14:09:10,705 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-16 14:09:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:09:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:09:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:09:10,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:09:10,790 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:09:10,791 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:09:12,182 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:09:12,183 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:09:12,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:09:12,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:09:12,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:09:12 BoogieIcfgContainer [2025-03-16 14:09:12,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:09:12,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:09:12,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:09:12,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:09:12,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:09:09" (1/3) ... [2025-03-16 14:09:12,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8b27e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:09:12, skipping insertion in model container [2025-03-16 14:09:12,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:10" (2/3) ... [2025-03-16 14:09:12,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8b27e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:09:12, skipping insertion in model container [2025-03-16 14:09:12,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:09:12" (3/3) ... [2025-03-16 14:09:12,209 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label05.c [2025-03-16 14:09:12,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:09:12,223 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label05.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:09:12,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:09:12,297 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;@46c5104d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:09:12,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:09:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 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-16 14:09:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 14:09:12,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:12,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:12,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1069370552, now seen corresponding path program 1 times [2025-03-16 14:09:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370074993] [2025-03-16 14:09:12,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:12,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 14:09:12,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 14:09:12,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:12,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:12,774 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-16 14:09:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370074993] [2025-03-16 14:09:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370074993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:12,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663527540] [2025-03-16 14:09:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:12,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:09:12,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:12,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:09:12,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:09:12,805 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 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 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 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-16 14:09:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:12,842 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:09:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:09:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 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 157 [2025-03-16 14:09:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:12,855 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:09:12,855 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:09:12,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:09:12,865 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:12,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:09:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:09:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:09:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-16 14:09:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:09:12,915 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 157 [2025-03-16 14:09:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:09:12,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 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-16 14:09:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:09:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 14:09:12,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:12,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:12,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:09:12,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:12,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 255487384, now seen corresponding path program 1 times [2025-03-16 14:09:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614410419] [2025-03-16 14:09:12,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:12,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 14:09:13,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 14:09:13,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:13,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:13,337 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-16 14:09:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614410419] [2025-03-16 14:09:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614410419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098774480] [2025-03-16 14:09:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:13,343 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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-16 14:09:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:14,094 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2025-03-16 14:09:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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 157 [2025-03-16 14:09:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:14,102 INFO L225 Difference]: With dead ends: 698 [2025-03-16 14:09:14,102 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 14:09:14,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:14,104 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:14,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 149 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 14:09:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-16 14:09:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 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-16 14:09:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2025-03-16 14:09:14,120 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 157 [2025-03-16 14:09:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:14,121 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2025-03-16 14:09:14,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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-16 14:09:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2025-03-16 14:09:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 14:09:14,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:14,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:14,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:09:14,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:14,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1524514134, now seen corresponding path program 1 times [2025-03-16 14:09:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313538125] [2025-03-16 14:09:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:14,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 14:09:14,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 14:09:14,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:14,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:14,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313538125] [2025-03-16 14:09:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313538125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:14,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:14,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070332407] [2025-03-16 14:09:14,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:14,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:14,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:14,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:14,301 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-16 14:09:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:14,984 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2025-03-16 14:09:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2025-03-16 14:09:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:14,987 INFO L225 Difference]: With dead ends: 1343 [2025-03-16 14:09:14,987 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:09:14,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:14,988 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:14,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:09:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2025-03-16 14:09:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.512672811059908) internal successors, (1313), 868 states have internal predecessors, (1313), 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-16 14:09:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1313 transitions. [2025-03-16 14:09:15,018 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1313 transitions. Word has length 165 [2025-03-16 14:09:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:15,018 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1313 transitions. [2025-03-16 14:09:15,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-16 14:09:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1313 transitions. [2025-03-16 14:09:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 14:09:15,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:15,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:15,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:09:15,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:15,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -301555253, now seen corresponding path program 1 times [2025-03-16 14:09:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969282786] [2025-03-16 14:09:15,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:15,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 14:09:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 14:09:15,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:15,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:09:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969282786] [2025-03-16 14:09:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969282786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037557614] [2025-03-16 14:09:15,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:15,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:15,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:15,330 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-16 14:09:15,331 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-16 14:09:15,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 14:09:15,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 14:09:15,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:15,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:15,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:15,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:09:15,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037557614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:15,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:09:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627373130] [2025-03-16 14:09:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:15,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:15,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:15,517 INFO L87 Difference]: Start difference. First operand 869 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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-16 14:09:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:15,724 INFO L93 Difference]: Finished difference Result 2600 states and 3932 transitions. [2025-03-16 14:09:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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 177 [2025-03-16 14:09:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:15,730 INFO L225 Difference]: With dead ends: 2600 [2025-03-16 14:09:15,731 INFO L226 Difference]: Without dead ends: 1732 [2025-03-16 14:09:15,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:15,733 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 360 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:15,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 600 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:09:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-16 14:09:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1728. [2025-03-16 14:09:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.5130283729009844) internal successors, (2613), 1727 states have internal predecessors, (2613), 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-16 14:09:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2613 transitions. [2025-03-16 14:09:15,775 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2613 transitions. Word has length 177 [2025-03-16 14:09:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:15,775 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2613 transitions. [2025-03-16 14:09:15,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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-16 14:09:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2613 transitions. [2025-03-16 14:09:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 14:09:15,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:15,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:15,790 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-16 14:09:15,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:15,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:15,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -258014554, now seen corresponding path program 1 times [2025-03-16 14:09:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202269923] [2025-03-16 14:09:15,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:16,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 14:09:16,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 14:09:16,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:16,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202269923] [2025-03-16 14:09:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202269923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687138162] [2025-03-16 14:09:16,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:16,222 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-16 14:09:16,223 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-16 14:09:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 14:09:16,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 14:09:16,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:16,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:16,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:16,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:16,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687138162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:16,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:09:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427012992] [2025-03-16 14:09:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:16,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:16,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:16,384 INFO L87 Difference]: Start difference. First operand 1728 states and 2613 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-16 14:09:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:17,053 INFO L93 Difference]: Finished difference Result 5087 states and 7709 transitions. [2025-03-16 14:09:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:17,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 179 [2025-03-16 14:09:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:17,066 INFO L225 Difference]: With dead ends: 5087 [2025-03-16 14:09:17,067 INFO L226 Difference]: Without dead ends: 3360 [2025-03-16 14:09:17,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-16 14:09:17,072 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 231 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:17,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 413 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2025-03-16 14:09:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3356. [2025-03-16 14:09:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3355 states have (on average 1.3368107302533532) internal successors, (4485), 3355 states have internal predecessors, (4485), 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-16 14:09:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4485 transitions. [2025-03-16 14:09:17,149 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4485 transitions. Word has length 179 [2025-03-16 14:09:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:17,150 INFO L471 AbstractCegarLoop]: Abstraction has 3356 states and 4485 transitions. [2025-03-16 14:09:17,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-16 14:09:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4485 transitions. [2025-03-16 14:09:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 14:09:17,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:17,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:17,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:09:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:17,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:17,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1705901173, now seen corresponding path program 1 times [2025-03-16 14:09:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959132261] [2025-03-16 14:09:17,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:17,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 14:09:17,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 14:09:17,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:17,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959132261] [2025-03-16 14:09:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959132261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115747964] [2025-03-16 14:09:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:17,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:17,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:17,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:17,531 INFO L87 Difference]: Start difference. First operand 3356 states and 4485 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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-16 14:09:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:18,197 INFO L93 Difference]: Finished difference Result 9982 states and 13346 transitions. [2025-03-16 14:09:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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 180 [2025-03-16 14:09:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:18,216 INFO L225 Difference]: With dead ends: 9982 [2025-03-16 14:09:18,216 INFO L226 Difference]: Without dead ends: 6627 [2025-03-16 14:09:18,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:18,220 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 239 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:18,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 172 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2025-03-16 14:09:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 6625. [2025-03-16 14:09:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 6624 states have (on average 1.2844202898550725) internal successors, (8508), 6624 states have internal predecessors, (8508), 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-16 14:09:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 8508 transitions. [2025-03-16 14:09:18,331 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 8508 transitions. Word has length 180 [2025-03-16 14:09:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:18,331 INFO L471 AbstractCegarLoop]: Abstraction has 6625 states and 8508 transitions. [2025-03-16 14:09:18,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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-16 14:09:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 8508 transitions. [2025-03-16 14:09:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-16 14:09:18,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:18,339 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:09:18,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 995834820, now seen corresponding path program 1 times [2025-03-16 14:09:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378022021] [2025-03-16 14:09:18,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:18,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 14:09:18,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 14:09:18,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:18,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 14:09:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:18,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378022021] [2025-03-16 14:09:18,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378022021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:18,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:18,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:18,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481699737] [2025-03-16 14:09:18,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:18,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:18,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:18,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:18,460 INFO L87 Difference]: Start difference. First operand 6625 states and 8508 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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-16 14:09:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:18,824 INFO L93 Difference]: Finished difference Result 13185 states and 16929 transitions. [2025-03-16 14:09:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:18,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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 192 [2025-03-16 14:09:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:18,843 INFO L225 Difference]: With dead ends: 13185 [2025-03-16 14:09:18,844 INFO L226 Difference]: Without dead ends: 6561 [2025-03-16 14:09:18,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:18,851 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:18,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:09:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2025-03-16 14:09:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 6561. [2025-03-16 14:09:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 1.2557926829268293) internal successors, (8238), 6560 states have internal predecessors, (8238), 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-16 14:09:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 8238 transitions. [2025-03-16 14:09:18,969 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 8238 transitions. Word has length 192 [2025-03-16 14:09:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:18,970 INFO L471 AbstractCegarLoop]: Abstraction has 6561 states and 8238 transitions. [2025-03-16 14:09:18,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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-16 14:09:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 8238 transitions. [2025-03-16 14:09:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 14:09:18,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:18,977 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:18,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:09:18,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:18,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1615908282, now seen corresponding path program 1 times [2025-03-16 14:09:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:18,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110436029] [2025-03-16 14:09:18,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:19,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 14:09:19,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 14:09:19,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:19,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110436029] [2025-03-16 14:09:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110436029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435420403] [2025-03-16 14:09:19,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:19,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:19,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:09:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 14:09:19,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 14:09:19,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:19,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:19,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:09:19,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:20,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435420403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:20,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:20,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:09:20,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823495843] [2025-03-16 14:09:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:20,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:20,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:20,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:20,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:20,096 INFO L87 Difference]: Start difference. First operand 6561 states and 8238 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-16 14:09:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:20,746 INFO L93 Difference]: Finished difference Result 19227 states and 24209 transitions. [2025-03-16 14:09:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-03-16 14:09:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:20,779 INFO L225 Difference]: With dead ends: 19227 [2025-03-16 14:09:20,779 INFO L226 Difference]: Without dead ends: 12667 [2025-03-16 14:09:20,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:20,789 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 86 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:20,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 344 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12667 states. [2025-03-16 14:09:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12667 to 12659. [2025-03-16 14:09:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.2249960499288988) internal successors, (15506), 12658 states have internal predecessors, (15506), 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-16 14:09:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 15506 transitions. [2025-03-16 14:09:21,007 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 15506 transitions. Word has length 195 [2025-03-16 14:09:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:21,008 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 15506 transitions. [2025-03-16 14:09:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-16 14:09:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 15506 transitions. [2025-03-16 14:09:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 14:09:21,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:21,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:21,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:09:21,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:21,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:21,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash 820981458, now seen corresponding path program 1 times [2025-03-16 14:09:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723564072] [2025-03-16 14:09:21,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:21,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:09:21,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:09:21,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:21,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:09:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723564072] [2025-03-16 14:09:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723564072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503203558] [2025-03-16 14:09:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:21,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:21,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:21,413 INFO L87 Difference]: Start difference. First operand 12659 states and 15506 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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-16 14:09:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:22,055 INFO L93 Difference]: Finished difference Result 31439 states and 38399 transitions. [2025-03-16 14:09:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:22,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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 217 [2025-03-16 14:09:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:22,087 INFO L225 Difference]: With dead ends: 31439 [2025-03-16 14:09:22,087 INFO L226 Difference]: Without dead ends: 18781 [2025-03-16 14:09:22,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:22,099 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:22,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 105 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18781 states. [2025-03-16 14:09:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18781 to 18779. [2025-03-16 14:09:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.2087549259772075) internal successors, (22698), 18778 states have internal predecessors, (22698), 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-16 14:09:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 22698 transitions. [2025-03-16 14:09:22,327 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 22698 transitions. Word has length 217 [2025-03-16 14:09:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 22698 transitions. [2025-03-16 14:09:22,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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-16 14:09:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 22698 transitions. [2025-03-16 14:09:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 14:09:22,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:22,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:22,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:09:22,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1372531567, now seen corresponding path program 1 times [2025-03-16 14:09:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704070546] [2025-03-16 14:09:22,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:22,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 14:09:22,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 14:09:22,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:22,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:09:22,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704070546] [2025-03-16 14:09:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704070546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165304853] [2025-03-16 14:09:22,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:22,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:22,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:22,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:09:22,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 14:09:22,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 14:09:22,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:22,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:22,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:22,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165304853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:09:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107540784] [2025-03-16 14:09:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:22,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:22,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:22,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:22,900 INFO L87 Difference]: Start difference. First operand 18779 states and 22698 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-16 14:09:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:23,597 INFO L93 Difference]: Finished difference Result 45074 states and 55543 transitions. [2025-03-16 14:09:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 224 [2025-03-16 14:09:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:23,646 INFO L225 Difference]: With dead ends: 45074 [2025-03-16 14:09:23,646 INFO L226 Difference]: Without dead ends: 26296 [2025-03-16 14:09:23,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:23,664 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 204 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:23,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 134 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26296 states. [2025-03-16 14:09:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26296 to 26290. [2025-03-16 14:09:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26290 states, 26289 states have (on average 1.1791243485868614) internal successors, (30998), 26289 states have internal predecessors, (30998), 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-16 14:09:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26290 states to 26290 states and 30998 transitions. [2025-03-16 14:09:23,986 INFO L78 Accepts]: Start accepts. Automaton has 26290 states and 30998 transitions. Word has length 224 [2025-03-16 14:09:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:23,986 INFO L471 AbstractCegarLoop]: Abstraction has 26290 states and 30998 transitions. [2025-03-16 14:09:23,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-16 14:09:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26290 states and 30998 transitions. [2025-03-16 14:09:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-16 14:09:24,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:24,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:24,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:09:24,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:24,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 157314386, now seen corresponding path program 1 times [2025-03-16 14:09:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006888270] [2025-03-16 14:09:24,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:24,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-16 14:09:24,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-16 14:09:24,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:24,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:09:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006888270] [2025-03-16 14:09:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006888270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291757283] [2025-03-16 14:09:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:24,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:24,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:24,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:24,408 INFO L87 Difference]: Start difference. First operand 26290 states and 30998 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 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-16 14:09:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:25,121 INFO L93 Difference]: Finished difference Result 67667 states and 79672 transitions. [2025-03-16 14:09:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 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 239 [2025-03-16 14:09:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:25,197 INFO L225 Difference]: With dead ends: 67667 [2025-03-16 14:09:25,197 INFO L226 Difference]: Without dead ends: 41378 [2025-03-16 14:09:25,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:25,226 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:25,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 161 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41378 states. [2025-03-16 14:09:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41378 to 41372. [2025-03-16 14:09:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41372 states, 41371 states have (on average 1.17466341156849) internal successors, (48597), 41371 states have internal predecessors, (48597), 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-16 14:09:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41372 states to 41372 states and 48597 transitions. [2025-03-16 14:09:25,862 INFO L78 Accepts]: Start accepts. Automaton has 41372 states and 48597 transitions. Word has length 239 [2025-03-16 14:09:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:25,862 INFO L471 AbstractCegarLoop]: Abstraction has 41372 states and 48597 transitions. [2025-03-16 14:09:25,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 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-16 14:09:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 41372 states and 48597 transitions. [2025-03-16 14:09:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 14:09:25,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:25,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:25,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:09:25,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash 266806192, now seen corresponding path program 1 times [2025-03-16 14:09:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730394460] [2025-03-16 14:09:25,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:25,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 14:09:25,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 14:09:25,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:25,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:09:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730394460] [2025-03-16 14:09:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730394460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685564337] [2025-03-16 14:09:26,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:26,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:26,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:26,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:26,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:09:26,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 14:09:26,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 14:09:26,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:26,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:26,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:26,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:26,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685564337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:26,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:09:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185262021] [2025-03-16 14:09:26,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:26,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:26,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:26,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:26,890 INFO L87 Difference]: Start difference. First operand 41372 states and 48597 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-16 14:09:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:27,497 INFO L93 Difference]: Finished difference Result 82552 states and 96993 transitions. [2025-03-16 14:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 244 [2025-03-16 14:09:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:27,556 INFO L225 Difference]: With dead ends: 82552 [2025-03-16 14:09:27,556 INFO L226 Difference]: Without dead ends: 41181 [2025-03-16 14:09:27,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:27,592 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 255 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:27,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 288 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:09:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41181 states. [2025-03-16 14:09:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41181 to 41169. [2025-03-16 14:09:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41169 states, 41168 states have (on average 1.1644724057520404) internal successors, (47939), 41168 states have internal predecessors, (47939), 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-16 14:09:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41169 states to 41169 states and 47939 transitions. [2025-03-16 14:09:28,092 INFO L78 Accepts]: Start accepts. Automaton has 41169 states and 47939 transitions. Word has length 244 [2025-03-16 14:09:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:28,093 INFO L471 AbstractCegarLoop]: Abstraction has 41169 states and 47939 transitions. [2025-03-16 14:09:28,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-16 14:09:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 41169 states and 47939 transitions. [2025-03-16 14:09:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 14:09:28,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:28,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:09:28,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:09:28,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 14:09:28,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:28,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2146305296, now seen corresponding path program 1 times [2025-03-16 14:09:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:28,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476523674] [2025-03-16 14:09:28,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:28,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 14:09:28,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 14:09:28,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:28,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:09:29,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476523674] [2025-03-16 14:09:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476523674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590412322] [2025-03-16 14:09:29,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:29,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:29,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:29,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:09:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 14:09:29,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 14:09:29,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:29,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:29,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:29,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 14:09:29,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590412322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:09:29,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867858343] [2025-03-16 14:09:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:29,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:29,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:29,369 INFO L87 Difference]: Start difference. First operand 41169 states and 47939 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-16 14:09:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:30,026 INFO L93 Difference]: Finished difference Result 82349 states and 95897 transitions. [2025-03-16 14:09:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:30,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 256 [2025-03-16 14:09:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:30,082 INFO L225 Difference]: With dead ends: 82349 [2025-03-16 14:09:30,082 INFO L226 Difference]: Without dead ends: 41181 [2025-03-16 14:09:30,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 255 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-16 14:09:30,112 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:30,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 48 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:09:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41181 states. [2025-03-16 14:09:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41181 to 41169. [2025-03-16 14:09:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41169 states, 41168 states have (on average 1.1638408472600077) internal successors, (47913), 41168 states have internal predecessors, (47913), 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-16 14:09:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41169 states to 41169 states and 47913 transitions. [2025-03-16 14:09:30,752 INFO L78 Accepts]: Start accepts. Automaton has 41169 states and 47913 transitions. Word has length 256 [2025-03-16 14:09:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:30,752 INFO L471 AbstractCegarLoop]: Abstraction has 41169 states and 47913 transitions. [2025-03-16 14:09:30,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-16 14:09:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41169 states and 47913 transitions. [2025-03-16 14:09:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-16 14:09:30,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:30,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:30,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:09:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:30,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:30,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1143092242, now seen corresponding path program 1 times [2025-03-16 14:09:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13143107] [2025-03-16 14:09:30,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:31,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-16 14:09:31,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-16 14:09:31,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:31,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13143107] [2025-03-16 14:09:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13143107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833155283] [2025-03-16 14:09:32,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:32,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:32,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:32,004 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:32,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:09:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-16 14:09:32,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-16 14:09:32,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:32,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:09:32,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:32,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833155283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:32,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:32,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:09:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740628923] [2025-03-16 14:09:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:32,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:32,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:32,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:09:32,361 INFO L87 Difference]: Start difference. First operand 41169 states and 47913 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-16 14:09:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:33,083 INFO L93 Difference]: Finished difference Result 96151 states and 110931 transitions. [2025-03-16 14:09:33,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:33,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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 290 [2025-03-16 14:09:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:33,150 INFO L225 Difference]: With dead ends: 96151 [2025-03-16 14:09:33,151 INFO L226 Difference]: Without dead ends: 54983 [2025-03-16 14:09:33,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:09:33,185 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 295 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:33,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 151 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54983 states. [2025-03-16 14:09:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54983 to 50913. [2025-03-16 14:09:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50913 states, 50912 states have (on average 1.1428936203645506) internal successors, (58187), 50912 states have internal predecessors, (58187), 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-16 14:09:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50913 states to 50913 states and 58187 transitions. [2025-03-16 14:09:33,807 INFO L78 Accepts]: Start accepts. Automaton has 50913 states and 58187 transitions. Word has length 290 [2025-03-16 14:09:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:33,807 INFO L471 AbstractCegarLoop]: Abstraction has 50913 states and 58187 transitions. [2025-03-16 14:09:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-16 14:09:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 50913 states and 58187 transitions. [2025-03-16 14:09:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 14:09:33,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:33,839 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:33,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 14:09:34,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:34,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:34,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash -131347661, now seen corresponding path program 1 times [2025-03-16 14:09:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293728632] [2025-03-16 14:09:34,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 14:09:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 14:09:34,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:34,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:09:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293728632] [2025-03-16 14:09:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293728632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248592666] [2025-03-16 14:09:34,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:34,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:34,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:09:34,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 14:09:34,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 14:09:34,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:34,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:34,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:09:35,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:09:35,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248592666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:35,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:35,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:09:35,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454986081] [2025-03-16 14:09:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:35,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:35,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:09:35,080 INFO L87 Difference]: Start difference. First operand 50913 states and 58187 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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-16 14:09:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:36,008 INFO L93 Difference]: Finished difference Result 147648 states and 169151 transitions. [2025-03-16 14:09:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:36,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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 321 [2025-03-16 14:09:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:36,133 INFO L225 Difference]: With dead ends: 147648 [2025-03-16 14:09:36,133 INFO L226 Difference]: Without dead ends: 96736 [2025-03-16 14:09:36,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:09:36,180 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 531 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:36,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 479 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96736 states. [2025-03-16 14:09:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96736 to 96712. [2025-03-16 14:09:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96712 states, 96711 states have (on average 1.1432412031723382) internal successors, (110564), 96711 states have internal predecessors, (110564), 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-16 14:09:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96712 states to 96712 states and 110564 transitions. [2025-03-16 14:09:37,488 INFO L78 Accepts]: Start accepts. Automaton has 96712 states and 110564 transitions. Word has length 321 [2025-03-16 14:09:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:37,488 INFO L471 AbstractCegarLoop]: Abstraction has 96712 states and 110564 transitions. [2025-03-16 14:09:37,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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-16 14:09:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96712 states and 110564 transitions. [2025-03-16 14:09:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 14:09:37,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:37,553 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:37,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 14:09:37,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:09:37,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -87875916, now seen corresponding path program 1 times [2025-03-16 14:09:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427676736] [2025-03-16 14:09:37,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:37,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 14:09:37,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 14:09:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:09:38,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:38,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427676736] [2025-03-16 14:09:38,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427676736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:38,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806367653] [2025-03-16 14:09:38,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:38,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:38,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:38,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:38,091 INFO L87 Difference]: Start difference. First operand 96712 states and 110564 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-16 14:09:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:39,392 INFO L93 Difference]: Finished difference Result 222658 states and 254941 transitions. [2025-03-16 14:09:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:39,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 350 [2025-03-16 14:09:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:39,533 INFO L225 Difference]: With dead ends: 222658 [2025-03-16 14:09:39,533 INFO L226 Difference]: Without dead ends: 125947 [2025-03-16 14:09:39,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:39,567 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 149 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:39,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 152 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125947 states. [2025-03-16 14:09:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125947 to 119029. [2025-03-16 14:09:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119029 states, 119028 states have (on average 1.1376650872063716) internal successors, (135414), 119028 states have internal predecessors, (135414), 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-16 14:09:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119029 states to 119029 states and 135414 transitions. [2025-03-16 14:09:41,332 INFO L78 Accepts]: Start accepts. Automaton has 119029 states and 135414 transitions. Word has length 350 [2025-03-16 14:09:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:41,333 INFO L471 AbstractCegarLoop]: Abstraction has 119029 states and 135414 transitions. [2025-03-16 14:09:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-16 14:09:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 119029 states and 135414 transitions. [2025-03-16 14:09:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-16 14:09:41,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:41,390 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:41,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:09:41,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:41,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1757326917, now seen corresponding path program 1 times [2025-03-16 14:09:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:41,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482492267] [2025-03-16 14:09:41,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:41,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-16 14:09:41,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-16 14:09:41,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:41,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-16 14:09:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482492267] [2025-03-16 14:09:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482492267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:41,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555544244] [2025-03-16 14:09:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:41,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:41,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:41,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:41,685 INFO L87 Difference]: Start difference. First operand 119029 states and 135414 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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-16 14:09:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:43,383 INFO L93 Difference]: Finished difference Result 346561 states and 394178 transitions. [2025-03-16 14:09:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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 355 [2025-03-16 14:09:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:43,695 INFO L225 Difference]: With dead ends: 346561 [2025-03-16 14:09:43,695 INFO L226 Difference]: Without dead ends: 227533 [2025-03-16 14:09:43,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:43,751 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 498 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:43,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 366 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227533 states. [2025-03-16 14:09:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227533 to 198669. [2025-03-16 14:09:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198669 states, 198668 states have (on average 1.1324118630076307) internal successors, (224974), 198668 states have internal predecessors, (224974), 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-16 14:09:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198669 states to 198669 states and 224974 transitions. [2025-03-16 14:09:46,640 INFO L78 Accepts]: Start accepts. Automaton has 198669 states and 224974 transitions. Word has length 355 [2025-03-16 14:09:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:46,641 INFO L471 AbstractCegarLoop]: Abstraction has 198669 states and 224974 transitions. [2025-03-16 14:09:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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-16 14:09:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 198669 states and 224974 transitions. [2025-03-16 14:09:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-16 14:09:46,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:46,994 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:46,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:09:46,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 907318225, now seen corresponding path program 1 times [2025-03-16 14:09:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:46,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497144633] [2025-03-16 14:09:46,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:46,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:47,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 14:09:47,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 14:09:47,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:47,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-16 14:09:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497144633] [2025-03-16 14:09:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497144633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976871395] [2025-03-16 14:09:47,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:47,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:47,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:47,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:09:47,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 14:09:47,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 14:09:47,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 14:09:47,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:47,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:47,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:09:47,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-16 14:09:47,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976871395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:47,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:09:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344294682] [2025-03-16 14:09:47,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:47,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:47,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:47,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:47,583 INFO L87 Difference]: Start difference. First operand 198669 states and 224974 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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-16 14:09:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:49,954 INFO L93 Difference]: Finished difference Result 599548 states and 679457 transitions. [2025-03-16 14:09:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:49,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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 378 [2025-03-16 14:09:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:50,537 INFO L225 Difference]: With dead ends: 599548 [2025-03-16 14:09:50,537 INFO L226 Difference]: Without dead ends: 400880 [2025-03-16 14:09:50,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:50,629 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 741 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:50,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 331 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400880 states. [2025-03-16 14:09:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400880 to 395173. [2025-03-16 14:09:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395173 states, 395172 states have (on average 1.1280682841901755) internal successors, (445781), 395172 states have internal predecessors, (445781), 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-16 14:09:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395173 states to 395173 states and 445781 transitions. [2025-03-16 14:09:56,701 INFO L78 Accepts]: Start accepts. Automaton has 395173 states and 445781 transitions. Word has length 378 [2025-03-16 14:09:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:56,701 INFO L471 AbstractCegarLoop]: Abstraction has 395173 states and 445781 transitions. [2025-03-16 14:09:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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-16 14:09:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 395173 states and 445781 transitions. [2025-03-16 14:09:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-16 14:09:56,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:56,859 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:56,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 14:09:57,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 14:09:57,059 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -979684788, now seen corresponding path program 1 times [2025-03-16 14:09:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402067386] [2025-03-16 14:09:57,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:57,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 14:09:57,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 14:09:57,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 14:09:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402067386] [2025-03-16 14:09:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402067386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418007664] [2025-03-16 14:09:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:57,305 INFO L87 Difference]: Start difference. First operand 395173 states and 445781 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-16 14:10:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:10:00,246 INFO L93 Difference]: Finished difference Result 818247 states and 922608 transitions. [2025-03-16 14:10:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:10:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 383 [2025-03-16 14:10:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:10:01,329 INFO L225 Difference]: With dead ends: 818247 [2025-03-16 14:10:01,329 INFO L226 Difference]: Without dead ends: 423075 [2025-03-16 14:10:01,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:10:01,489 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 133 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:10:01,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 333 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:10:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423075 states. [2025-03-16 14:10:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423075 to 409219. [2025-03-16 14:10:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409219 states, 409218 states have (on average 1.1267735045867973) internal successors, (461096), 409218 states have internal predecessors, (461096), 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-16 14:10:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409219 states to 409219 states and 461096 transitions. [2025-03-16 14:10:07,258 INFO L78 Accepts]: Start accepts. Automaton has 409219 states and 461096 transitions. Word has length 383 [2025-03-16 14:10:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:10:07,258 INFO L471 AbstractCegarLoop]: Abstraction has 409219 states and 461096 transitions. [2025-03-16 14:10:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-16 14:10:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 409219 states and 461096 transitions. [2025-03-16 14:10:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-16 14:10:07,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:10:07,851 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:10:07,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:10:07,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:10:07,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:10:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1268762468, now seen corresponding path program 1 times [2025-03-16 14:10:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:10:07,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181089911] [2025-03-16 14:10:07,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:10:07,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:10:07,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-16 14:10:07,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-16 14:10:07,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:10:07,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat