./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:10:31,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:10:31,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:10:31,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:10:31,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:10:31,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:10:31,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:10:31,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:10:31,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:10:31,718 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:10:31,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:10:31,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:10:31,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:10:31,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:10:31,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:10:31,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:10:31,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:10:31,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:10:31,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:10:31,721 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-jdk21/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 -> 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 [2025-02-05 16:10:31,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:10:31,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:10:31,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:10:31,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:10:31,965 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:10:31,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2025-02-05 16:10:33,283 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de0622b52/dc9988d50c4942568788f128ce85f650/FLAG379263d97 [2025-02-05 16:10:33,572 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:10:33,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2025-02-05 16:10:33,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de0622b52/dc9988d50c4942568788f128ce85f650/FLAG379263d97 [2025-02-05 16:10:33,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de0622b52/dc9988d50c4942568788f128ce85f650 [2025-02-05 16:10:33,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:10:33,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:10:33,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:10:33,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:10:33,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:10:33,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:10:33" (1/1) ... [2025-02-05 16:10:33,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4316ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:33, skipping insertion in model container [2025-02-05 16:10:33,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:10:33" (1/1) ... [2025-02-05 16:10:33,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:10:34,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c[11921,11934] [2025-02-05 16:10:34,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:10:34,148 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:10:34,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c[11921,11934] [2025-02-05 16:10:34,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:10:34,221 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:10:34,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34 WrapperNode [2025-02-05 16:10:34,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:10:34,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:10:34,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:10:34,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:10:34,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,276 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 413 [2025-02-05 16:10:34,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:10:34,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:10:34,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:10:34,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:10:34,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,306 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-02-05 16:10:34,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:10:34,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:10:34,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:10:34,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:10:34,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (1/1) ... [2025-02-05 16:10:34,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:10:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:34,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:10:34,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:10:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:10:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-02-05 16:10:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-02-05 16:10:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:10:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:10:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-02-05 16:10:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-02-05 16:10:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-02-05 16:10:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-02-05 16:10:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-02-05 16:10:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-02-05 16:10:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:10:34,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:10:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:10:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:10:34,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:10:34,477 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:10:34,478 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:10:35,005 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-02-05 16:10:35,005 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:10:35,021 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:10:35,024 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:10:35,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:10:35 BoogieIcfgContainer [2025-02-05 16:10:35,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:10:35,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:10:35,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:10:35,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:10:35,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:10:33" (1/3) ... [2025-02-05 16:10:35,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74708e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:10:35, skipping insertion in model container [2025-02-05 16:10:35,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:34" (2/3) ... [2025-02-05 16:10:35,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74708e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:10:35, skipping insertion in model container [2025-02-05 16:10:35,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:10:35" (3/3) ... [2025-02-05 16:10:35,039 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2025-02-05 16:10:35,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:10:35,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c that has 7 procedures, 175 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:10:35,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:10:35,107 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;@3382d3df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:10:35,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:10:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 135 states have internal predecessors, (205), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 16:10:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 16:10:35,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:35,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:35,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1575250835, now seen corresponding path program 1 times [2025-02-05 16:10:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452858139] [2025-02-05 16:10:35,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:35,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 16:10:35,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 16:10:35,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:35,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:35,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:35,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452858139] [2025-02-05 16:10:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452858139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:35,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496773236] [2025-02-05 16:10:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:35,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:35,422 INFO L87 Difference]: Start difference. First operand has 175 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 135 states have internal predecessors, (205), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:10:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:35,529 INFO L93 Difference]: Finished difference Result 350 states and 597 transitions. [2025-02-05 16:10:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:35,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 16:10:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:35,541 INFO L225 Difference]: With dead ends: 350 [2025-02-05 16:10:35,542 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 16:10:35,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:35,551 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 7 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:35,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 794 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 16:10:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-02-05 16:10:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.556390977443609) internal successors, (207), 137 states have internal predecessors, (207), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 16:10:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 281 transitions. [2025-02-05 16:10:35,590 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 281 transitions. Word has length 15 [2025-02-05 16:10:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:35,591 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 281 transitions. [2025-02-05 16:10:35,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:10:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 281 transitions. [2025-02-05 16:10:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 16:10:35,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:35,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:35,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:10:35,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:35,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash -864184555, now seen corresponding path program 1 times [2025-02-05 16:10:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191495746] [2025-02-05 16:10:35,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 16:10:35,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 16:10:35,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:35,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:35,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191495746] [2025-02-05 16:10:35,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191495746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:35,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:35,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139779326] [2025-02-05 16:10:35,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:35,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:35,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:35,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:35,747 INFO L87 Difference]: Start difference. First operand 178 states and 281 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:10:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:35,831 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2025-02-05 16:10:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:35,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 16:10:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:35,834 INFO L225 Difference]: With dead ends: 367 [2025-02-05 16:10:35,839 INFO L226 Difference]: Without dead ends: 192 [2025-02-05 16:10:35,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:35,841 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 22 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:35,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 812 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-05 16:10:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2025-02-05 16:10:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 147 states have internal predecessors, (220), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 16:10:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 296 transitions. [2025-02-05 16:10:35,878 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 296 transitions. Word has length 16 [2025-02-05 16:10:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:35,878 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 296 transitions. [2025-02-05 16:10:35,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:10:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 296 transitions. [2025-02-05 16:10:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 16:10:35,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:35,880 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:35,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:10:35,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:35,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1876350071, now seen corresponding path program 1 times [2025-02-05 16:10:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599291512] [2025-02-05 16:10:35,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:35,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 16:10:35,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 16:10:35,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:35,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:36,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599291512] [2025-02-05 16:10:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599291512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:36,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993474295] [2025-02-05 16:10:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:36,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:36,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:36,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:36,003 INFO L87 Difference]: Start difference. First operand 190 states and 296 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:36,021 INFO L93 Difference]: Finished difference Result 399 states and 629 transitions. [2025-02-05 16:10:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-05 16:10:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:36,023 INFO L225 Difference]: With dead ends: 399 [2025-02-05 16:10:36,023 INFO L226 Difference]: Without dead ends: 219 [2025-02-05 16:10:36,024 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-02-05 16:10:36,024 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:36,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 544 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-05 16:10:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2025-02-05 16:10:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 149 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 16:10:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 298 transitions. [2025-02-05 16:10:36,035 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 298 transitions. Word has length 23 [2025-02-05 16:10:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 298 transitions. [2025-02-05 16:10:36,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 298 transitions. [2025-02-05 16:10:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 16:10:36,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,036 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:10:36,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:10:36,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2106902977, now seen corresponding path program 1 times [2025-02-05 16:10:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859485881] [2025-02-05 16:10:36,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 16:10:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 16:10:36,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:36,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859485881] [2025-02-05 16:10:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859485881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:36,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926038747] [2025-02-05 16:10:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:36,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:36,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:36,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:36,114 INFO L87 Difference]: Start difference. First operand 192 states and 298 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:10:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:36,143 INFO L93 Difference]: Finished difference Result 375 states and 586 transitions. [2025-02-05 16:10:36,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-05 16:10:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:36,145 INFO L225 Difference]: With dead ends: 375 [2025-02-05 16:10:36,145 INFO L226 Difference]: Without dead ends: 198 [2025-02-05 16:10:36,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 16:10:36,146 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:36,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1082 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-05 16:10:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2025-02-05 16:10:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 152 states have internal predecessors, (225), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-02-05 16:10:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 302 transitions. [2025-02-05 16:10:36,157 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 302 transitions. Word has length 32 [2025-02-05 16:10:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 302 transitions. [2025-02-05 16:10:36,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:10:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 302 transitions. [2025-02-05 16:10:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 16:10:36,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,158 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:10:36,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:10:36,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1600697599, now seen corresponding path program 1 times [2025-02-05 16:10:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386305716] [2025-02-05 16:10:36,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 16:10:36,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 16:10:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:36,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:36,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386305716] [2025-02-05 16:10:36,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386305716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:36,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665338021] [2025-02-05 16:10:36,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:36,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:36,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:36,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:10:36,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 16:10:36,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 16:10:36,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:10:36,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:36,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:36,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665338021] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:36,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:36,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:10:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597908216] [2025-02-05 16:10:36,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:36,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:36,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:36,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:36,406 INFO L87 Difference]: Start difference. First operand 196 states and 302 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 16:10:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:36,470 INFO L93 Difference]: Finished difference Result 440 states and 692 transitions. [2025-02-05 16:10:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-02-05 16:10:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:36,472 INFO L225 Difference]: With dead ends: 440 [2025-02-05 16:10:36,473 INFO L226 Difference]: Without dead ends: 259 [2025-02-05 16:10:36,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:36,474 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 73 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:36,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 834 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-05 16:10:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 249. [2025-02-05 16:10:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 191 states have (on average 1.4973821989528795) internal successors, (286), 195 states have internal predecessors, (286), 48 states have call successors, (48), 8 states have call predecessors, (48), 9 states have return successors, (49), 49 states have call predecessors, (49), 48 states have call successors, (49) [2025-02-05 16:10:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 383 transitions. [2025-02-05 16:10:36,488 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 383 transitions. Word has length 34 [2025-02-05 16:10:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,488 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 383 transitions. [2025-02-05 16:10:36,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 16:10:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 383 transitions. [2025-02-05 16:10:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 16:10:36,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,489 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] [2025-02-05 16:10:36,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:10:36,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:36,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1233726486, now seen corresponding path program 1 times [2025-02-05 16:10:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133475799] [2025-02-05 16:10:36,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 16:10:36,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 16:10:36,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133475799] [2025-02-05 16:10:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133475799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:36,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:36,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:10:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080282238] [2025-02-05 16:10:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:36,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:36,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:36,794 INFO L87 Difference]: Start difference. First operand 249 states and 383 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 16:10:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:36,842 INFO L93 Difference]: Finished difference Result 392 states and 609 transitions. [2025-02-05 16:10:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:10:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-02-05 16:10:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:36,845 INFO L225 Difference]: With dead ends: 392 [2025-02-05 16:10:36,845 INFO L226 Difference]: Without dead ends: 245 [2025-02-05 16:10:36,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-05 16:10:36,846 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:36,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1315 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-05 16:10:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-05 16:10:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 192 states have internal predecessors, (276), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 16:10:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2025-02-05 16:10:36,862 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 35 [2025-02-05 16:10:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,862 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2025-02-05 16:10:36,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 16:10:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2025-02-05 16:10:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:10:36,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:36,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:10:36,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2079640897, now seen corresponding path program 2 times [2025-02-05 16:10:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066673304] [2025-02-05 16:10:36,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:10:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-05 16:10:36,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-02-05 16:10:36,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:10:36,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 16:10:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066673304] [2025-02-05 16:10:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066673304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:36,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569640233] [2025-02-05 16:10:36,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:36,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:36,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:36,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:36,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:36,911 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:10:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:36,951 INFO L93 Difference]: Finished difference Result 469 states and 729 transitions. [2025-02-05 16:10:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:36,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-02-05 16:10:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:36,956 INFO L225 Difference]: With dead ends: 469 [2025-02-05 16:10:36,956 INFO L226 Difference]: Without dead ends: 252 [2025-02-05 16:10:36,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:36,958 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 8 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:36,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-05 16:10:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-05 16:10:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 198 states have internal predecessors, (284), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 16:10:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2025-02-05 16:10:36,979 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 56 [2025-02-05 16:10:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2025-02-05 16:10:36,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:10:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2025-02-05 16:10:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:10:36,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,981 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:10:36,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1416105493, now seen corresponding path program 1 times [2025-02-05 16:10:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844814156] [2025-02-05 16:10:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:10:37,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:10:37,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 16:10:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844814156] [2025-02-05 16:10:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844814156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951792203] [2025-02-05 16:10:37,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:37,041 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:10:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,074 INFO L93 Difference]: Finished difference Result 513 states and 785 transitions. [2025-02-05 16:10:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-02-05 16:10:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,076 INFO L225 Difference]: With dead ends: 513 [2025-02-05 16:10:37,077 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 16:10:37,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,078 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 22 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 799 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 16:10:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-02-05 16:10:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 225 states have (on average 1.4222222222222223) internal successors, (320), 229 states have internal predecessors, (320), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 16:10:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 422 transitions. [2025-02-05 16:10:37,088 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 422 transitions. Word has length 56 [2025-02-05 16:10:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,088 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 422 transitions. [2025-02-05 16:10:37,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:10:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 422 transitions. [2025-02-05 16:10:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:10:37,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,089 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 16:10:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:10:37,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash 837152264, now seen corresponding path program 1 times [2025-02-05 16:10:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452414937] [2025-02-05 16:10:37,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:10:37,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:10:37,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452414937] [2025-02-05 16:10:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452414937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649464492] [2025-02-05 16:10:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:37,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,177 INFO L87 Difference]: Start difference. First operand 287 states and 422 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,200 INFO L93 Difference]: Finished difference Result 525 states and 785 transitions. [2025-02-05 16:10:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2025-02-05 16:10:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,202 INFO L225 Difference]: With dead ends: 525 [2025-02-05 16:10:37,202 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 16:10:37,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 16:10:37,203 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 16:10:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-02-05 16:10:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 225 states have (on average 1.4088888888888889) internal successors, (317), 229 states have internal predecessors, (317), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 16:10:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 419 transitions. [2025-02-05 16:10:37,218 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 419 transitions. Word has length 74 [2025-02-05 16:10:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,218 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 419 transitions. [2025-02-05 16:10:37,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 419 transitions. [2025-02-05 16:10:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:10:37,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,219 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:10:37,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1689690840, now seen corresponding path program 1 times [2025-02-05 16:10:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362739361] [2025-02-05 16:10:37,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:10:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:10:37,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-05 16:10:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362739361] [2025-02-05 16:10:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362739361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715936188] [2025-02-05 16:10:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:37,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:37,326 INFO L87 Difference]: Start difference. First operand 287 states and 419 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,364 INFO L93 Difference]: Finished difference Result 560 states and 839 transitions. [2025-02-05 16:10:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:37,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-02-05 16:10:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,367 INFO L225 Difference]: With dead ends: 560 [2025-02-05 16:10:37,367 INFO L226 Difference]: Without dead ends: 329 [2025-02-05 16:10:37,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,368 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 23 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 799 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-05 16:10:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2025-02-05 16:10:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 261 states have (on average 1.371647509578544) internal successors, (358), 265 states have internal predecessors, (358), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 16:10:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 466 transitions. [2025-02-05 16:10:37,385 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 466 transitions. Word has length 102 [2025-02-05 16:10:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,386 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 466 transitions. [2025-02-05 16:10:37,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 466 transitions. [2025-02-05 16:10:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:10:37,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,386 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:10:37,387 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1951756630, now seen corresponding path program 1 times [2025-02-05 16:10:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281402455] [2025-02-05 16:10:37,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:10:37,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:10:37,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-02-05 16:10:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281402455] [2025-02-05 16:10:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281402455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846091260] [2025-02-05 16:10:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:37,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:37,468 INFO L87 Difference]: Start difference. First operand 327 states and 466 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,526 INFO L93 Difference]: Finished difference Result 586 states and 859 transitions. [2025-02-05 16:10:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-02-05 16:10:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,528 INFO L225 Difference]: With dead ends: 586 [2025-02-05 16:10:37,528 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 16:10:37,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,529 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 9 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 767 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 16:10:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-02-05 16:10:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 256 states have (on average 1.3515625) internal successors, (346), 260 states have internal predecessors, (346), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 16:10:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 452 transitions. [2025-02-05 16:10:37,540 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 452 transitions. Word has length 103 [2025-02-05 16:10:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,541 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 452 transitions. [2025-02-05 16:10:37,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 452 transitions. [2025-02-05 16:10:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 16:10:37,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,541 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 16:10:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:10:37,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1477050620, now seen corresponding path program 1 times [2025-02-05 16:10:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575422535] [2025-02-05 16:10:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:10:37,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:10:37,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-02-05 16:10:37,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575422535] [2025-02-05 16:10:37,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575422535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:37,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046538242] [2025-02-05 16:10:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:37,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,617 INFO L87 Difference]: Start difference. First operand 321 states and 452 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,640 INFO L93 Difference]: Finished difference Result 562 states and 809 transitions. [2025-02-05 16:10:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 122 [2025-02-05 16:10:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,642 INFO L225 Difference]: With dead ends: 562 [2025-02-05 16:10:37,642 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 16:10:37,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 16:10:37,644 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1053 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 16:10:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2025-02-05 16:10:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 256 states have (on average 1.33984375) internal successors, (343), 260 states have internal predecessors, (343), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 16:10:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 449 transitions. [2025-02-05 16:10:37,656 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 449 transitions. Word has length 122 [2025-02-05 16:10:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,656 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 449 transitions. [2025-02-05 16:10:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2025-02-05 16:10:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:10:37,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,657 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 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-02-05 16:10:37,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:10:37,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1163866500, now seen corresponding path program 1 times [2025-02-05 16:10:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223739678] [2025-02-05 16:10:37,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:10:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:10:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-05 16:10:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223739678] [2025-02-05 16:10:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223739678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41291390] [2025-02-05 16:10:37,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:37,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:37,735 INFO L87 Difference]: Start difference. First operand 321 states and 449 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,781 INFO L93 Difference]: Finished difference Result 525 states and 769 transitions. [2025-02-05 16:10:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:37,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-02-05 16:10:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,784 INFO L225 Difference]: With dead ends: 525 [2025-02-05 16:10:37,784 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 16:10:37,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,785 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 735 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 16:10:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 16:10:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 255 states have (on average 1.3372549019607842) internal successors, (341), 259 states have internal predecessors, (341), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 16:10:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 445 transitions. [2025-02-05 16:10:37,795 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 445 transitions. Word has length 154 [2025-02-05 16:10:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,795 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 445 transitions. [2025-02-05 16:10:37,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 445 transitions. [2025-02-05 16:10:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 16:10:37,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,796 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:37,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:10:37,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1866225710, now seen corresponding path program 1 times [2025-02-05 16:10:37,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486188126] [2025-02-05 16:10:37,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 16:10:37,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 16:10:37,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-02-05 16:10:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486188126] [2025-02-05 16:10:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486188126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376799058] [2025-02-05 16:10:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:37,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:37,912 INFO L87 Difference]: Start difference. First operand 319 states and 445 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:10:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,964 INFO L93 Difference]: Finished difference Result 465 states and 665 transitions. [2025-02-05 16:10:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 173 [2025-02-05 16:10:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,966 INFO L225 Difference]: With dead ends: 465 [2025-02-05 16:10:37,966 INFO L226 Difference]: Without dead ends: 302 [2025-02-05 16:10:37,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:37,967 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 32 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 712 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-05 16:10:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-02-05 16:10:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 241 states have (on average 1.3278008298755186) internal successors, (320), 245 states have internal predecessors, (320), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 16:10:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 418 transitions. [2025-02-05 16:10:37,979 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 418 transitions. Word has length 173 [2025-02-05 16:10:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:37,979 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 418 transitions. [2025-02-05 16:10:37,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:10:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 418 transitions. [2025-02-05 16:10:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 16:10:37,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:37,981 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:37,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:10:37,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 536267041, now seen corresponding path program 1 times [2025-02-05 16:10:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:37,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733299547] [2025-02-05 16:10:37,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:37,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:10:38,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:10:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-02-05 16:10:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733299547] [2025-02-05 16:10:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733299547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:38,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941531144] [2025-02-05 16:10:38,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:38,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:38,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:38,073 INFO L87 Difference]: Start difference. First operand 302 states and 418 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:10:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:38,118 INFO L93 Difference]: Finished difference Result 448 states and 638 transitions. [2025-02-05 16:10:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:38,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2025-02-05 16:10:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:38,120 INFO L225 Difference]: With dead ends: 448 [2025-02-05 16:10:38,120 INFO L226 Difference]: Without dead ends: 283 [2025-02-05 16:10:38,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:38,121 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 28 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:38,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 715 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-05 16:10:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-05 16:10:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.32) internal successors, (297), 229 states have internal predecessors, (297), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 16:10:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 389 transitions. [2025-02-05 16:10:38,130 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 389 transitions. Word has length 175 [2025-02-05 16:10:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:38,130 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 389 transitions. [2025-02-05 16:10:38,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:10:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 389 transitions. [2025-02-05 16:10:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 16:10:38,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:38,132 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:10:38,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366024, now seen corresponding path program 1 times [2025-02-05 16:10:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984791062] [2025-02-05 16:10:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:38,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 16:10:38,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 16:10:38,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:38,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-05 16:10:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:38,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984791062] [2025-02-05 16:10:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984791062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:38,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:38,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019634411] [2025-02-05 16:10:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:38,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:38,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:38,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:38,320 INFO L87 Difference]: Start difference. First operand 283 states and 389 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 16:10:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:38,370 INFO L93 Difference]: Finished difference Result 429 states and 609 transitions. [2025-02-05 16:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 176 [2025-02-05 16:10:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:38,372 INFO L225 Difference]: With dead ends: 429 [2025-02-05 16:10:38,372 INFO L226 Difference]: Without dead ends: 283 [2025-02-05 16:10:38,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 16:10:38,373 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-05 16:10:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-05 16:10:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.2933333333333332) internal successors, (291), 229 states have internal predecessors, (291), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 16:10:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 383 transitions. [2025-02-05 16:10:38,399 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 383 transitions. Word has length 176 [2025-02-05 16:10:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 383 transitions. [2025-02-05 16:10:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 16:10:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 383 transitions. [2025-02-05 16:10:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 16:10:38,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:38,401 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:10:38,401 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:38,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1269721687, now seen corresponding path program 1 times [2025-02-05 16:10:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140778357] [2025-02-05 16:10:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 16:10:38,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 16:10:38,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:38,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-05 16:10:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140778357] [2025-02-05 16:10:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140778357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:38,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753219537] [2025-02-05 16:10:38,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:38,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:38,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:38,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:38,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:10:38,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 16:10:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 16:10:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:38,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:10:38,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-05 16:10:38,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-05 16:10:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753219537] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 16:10:38,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-02-05 16:10:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110376065] [2025-02-05 16:10:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:38,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:38,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:38,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:38,878 INFO L87 Difference]: Start difference. First operand 283 states and 383 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:38,910 INFO L93 Difference]: Finished difference Result 449 states and 630 transitions. [2025-02-05 16:10:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2025-02-05 16:10:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:38,912 INFO L225 Difference]: With dead ends: 449 [2025-02-05 16:10:38,912 INFO L226 Difference]: Without dead ends: 262 [2025-02-05 16:10:38,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:38,913 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 19 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:38,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 715 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-05 16:10:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-05 16:10:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.285024154589372) internal successors, (266), 211 states have internal predecessors, (266), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-05 16:10:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 352 transitions. [2025-02-05 16:10:38,922 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 352 transitions. Word has length 182 [2025-02-05 16:10:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:38,922 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 352 transitions. [2025-02-05 16:10:38,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 352 transitions. [2025-02-05 16:10:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 16:10:38,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:38,923 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:38,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:10:39,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 16:10:39,124 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash -17051796, now seen corresponding path program 1 times [2025-02-05 16:10:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:39,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171297073] [2025-02-05 16:10:39,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:39,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 16:10:39,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 16:10:39,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:39,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-02-05 16:10:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171297073] [2025-02-05 16:10:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171297073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474782833] [2025-02-05 16:10:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:39,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:39,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:39,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:39,221 INFO L87 Difference]: Start difference. First operand 262 states and 352 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-05 16:10:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:39,250 INFO L93 Difference]: Finished difference Result 405 states and 569 transitions. [2025-02-05 16:10:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 206 [2025-02-05 16:10:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:39,252 INFO L225 Difference]: With dead ends: 405 [2025-02-05 16:10:39,252 INFO L226 Difference]: Without dead ends: 266 [2025-02-05 16:10:39,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:39,253 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 3 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:39,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 755 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-05 16:10:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-02-05 16:10:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 214 states have internal predecessors, (269), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-05 16:10:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 355 transitions. [2025-02-05 16:10:39,265 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 355 transitions. Word has length 206 [2025-02-05 16:10:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:39,266 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 355 transitions. [2025-02-05 16:10:39,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-05 16:10:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 355 transitions. [2025-02-05 16:10:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 16:10:39,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:39,267 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:39,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:10:39,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:39,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash -246296222, now seen corresponding path program 1 times [2025-02-05 16:10:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667567465] [2025-02-05 16:10:39,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:39,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 16:10:39,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 16:10:39,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:39,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-02-05 16:10:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667567465] [2025-02-05 16:10:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667567465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479494845] [2025-02-05 16:10:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:39,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:39,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:39,457 INFO L87 Difference]: Start difference. First operand 266 states and 355 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:10:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:39,547 INFO L93 Difference]: Finished difference Result 414 states and 577 transitions. [2025-02-05 16:10:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:39,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 213 [2025-02-05 16:10:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:39,549 INFO L225 Difference]: With dead ends: 414 [2025-02-05 16:10:39,549 INFO L226 Difference]: Without dead ends: 271 [2025-02-05 16:10:39,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:39,550 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:39,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 757 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-05 16:10:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-05 16:10:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 218 states have internal predecessors, (273), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-05 16:10:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 359 transitions. [2025-02-05 16:10:39,564 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 359 transitions. Word has length 213 [2025-02-05 16:10:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:39,564 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 359 transitions. [2025-02-05 16:10:39,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:10:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 359 transitions. [2025-02-05 16:10:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 16:10:39,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:39,566 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2025-02-05 16:10:39,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:10:39,566 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:39,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1938295631, now seen corresponding path program 1 times [2025-02-05 16:10:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131475244] [2025-02-05 16:10:39,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:39,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 16:10:39,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 16:10:39,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:39,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-05 16:10:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131475244] [2025-02-05 16:10:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131475244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906291802] [2025-02-05 16:10:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:39,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:39,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:39,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:39,690 INFO L87 Difference]: Start difference. First operand 271 states and 359 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-05 16:10:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:39,719 INFO L93 Difference]: Finished difference Result 418 states and 577 transitions. [2025-02-05 16:10:39,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:39,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 221 [2025-02-05 16:10:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:39,722 INFO L225 Difference]: With dead ends: 418 [2025-02-05 16:10:39,722 INFO L226 Difference]: Without dead ends: 270 [2025-02-05 16:10:39,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:39,722 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 5 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:39,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 747 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-05 16:10:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-02-05 16:10:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2616822429906542) internal successors, (270), 217 states have internal predecessors, (270), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 16:10:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 354 transitions. [2025-02-05 16:10:39,733 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 354 transitions. Word has length 221 [2025-02-05 16:10:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:39,734 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 354 transitions. [2025-02-05 16:10:39,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-05 16:10:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 354 transitions. [2025-02-05 16:10:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 16:10:39,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:39,735 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2025-02-05 16:10:39,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:10:39,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:39,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1343399971, now seen corresponding path program 1 times [2025-02-05 16:10:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:39,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161470532] [2025-02-05 16:10:39,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:39,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 16:10:39,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 16:10:39,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-02-05 16:10:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161470532] [2025-02-05 16:10:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161470532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814313858] [2025-02-05 16:10:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:39,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:39,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:39,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:39,838 INFO L87 Difference]: Start difference. First operand 270 states and 354 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 16:10:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:39,849 INFO L93 Difference]: Finished difference Result 416 states and 566 transitions. [2025-02-05 16:10:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 229 [2025-02-05 16:10:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:39,851 INFO L225 Difference]: With dead ends: 416 [2025-02-05 16:10:39,851 INFO L226 Difference]: Without dead ends: 269 [2025-02-05 16:10:39,852 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-02-05 16:10:39,852 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:39,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 498 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-05 16:10:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-05 16:10:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 214 states have (on average 1.2570093457943925) internal successors, (269), 216 states have internal predecessors, (269), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 16:10:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 351 transitions. [2025-02-05 16:10:39,862 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 351 transitions. Word has length 229 [2025-02-05 16:10:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:39,863 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 351 transitions. [2025-02-05 16:10:39,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 16:10:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 351 transitions. [2025-02-05 16:10:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:10:39,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:39,864 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2025-02-05 16:10:39,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:10:39,865 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1965526202, now seen corresponding path program 1 times [2025-02-05 16:10:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79598036] [2025-02-05 16:10:39,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:10:39,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:10:39,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:39,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-02-05 16:10:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79598036] [2025-02-05 16:10:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79598036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:40,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:40,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:40,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095777870] [2025-02-05 16:10:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:40,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:40,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:40,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:40,044 INFO L87 Difference]: Start difference. First operand 269 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 16:10:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:40,113 INFO L93 Difference]: Finished difference Result 628 states and 847 transitions. [2025-02-05 16:10:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 230 [2025-02-05 16:10:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:40,117 INFO L225 Difference]: With dead ends: 628 [2025-02-05 16:10:40,117 INFO L226 Difference]: Without dead ends: 482 [2025-02-05 16:10:40,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:40,119 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 325 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:40,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 715 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-05 16:10:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 476. [2025-02-05 16:10:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 374 states have (on average 1.3101604278074865) internal successors, (490), 376 states have internal predecessors, (490), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 16:10:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 630 transitions. [2025-02-05 16:10:40,139 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 630 transitions. Word has length 230 [2025-02-05 16:10:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:40,139 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 630 transitions. [2025-02-05 16:10:40,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 16:10:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 630 transitions. [2025-02-05 16:10:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 16:10:40,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:40,142 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:40,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:10:40,142 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1641084888, now seen corresponding path program 1 times [2025-02-05 16:10:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:40,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100696182] [2025-02-05 16:10:40,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:40,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 16:10:40,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 16:10:40,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:40,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-02-05 16:10:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100696182] [2025-02-05 16:10:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100696182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:40,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344037331] [2025-02-05 16:10:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:40,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:40,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:40,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:40,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:40,260 INFO L87 Difference]: Start difference. First operand 476 states and 630 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 16:10:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:40,306 INFO L93 Difference]: Finished difference Result 1045 states and 1432 transitions. [2025-02-05 16:10:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:40,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 263 [2025-02-05 16:10:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:40,312 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:10:40,312 INFO L226 Difference]: Without dead ends: 764 [2025-02-05 16:10:40,313 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-02-05 16:10:40,313 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 172 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:40,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 521 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-02-05 16:10:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 595. [2025-02-05 16:10:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 468 states have (on average 1.3162393162393162) internal successors, (616), 474 states have internal predecessors, (616), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 16:10:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 786 transitions. [2025-02-05 16:10:40,351 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 786 transitions. Word has length 263 [2025-02-05 16:10:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:40,352 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 786 transitions. [2025-02-05 16:10:40,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 16:10:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 786 transitions. [2025-02-05 16:10:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 16:10:40,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:40,355 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:10:40,355 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -323067454, now seen corresponding path program 1 times [2025-02-05 16:10:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257169005] [2025-02-05 16:10:40,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:40,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 16:10:40,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 16:10:40,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:40,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-02-05 16:10:40,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:40,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257169005] [2025-02-05 16:10:40,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257169005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:40,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:40,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:40,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227843886] [2025-02-05 16:10:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:40,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:40,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:40,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:40,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:40,461 INFO L87 Difference]: Start difference. First operand 595 states and 786 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 16:10:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:40,509 INFO L93 Difference]: Finished difference Result 1319 states and 1790 transitions. [2025-02-05 16:10:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 264 [2025-02-05 16:10:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:40,516 INFO L225 Difference]: With dead ends: 1319 [2025-02-05 16:10:40,516 INFO L226 Difference]: Without dead ends: 952 [2025-02-05 16:10:40,517 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-02-05 16:10:40,517 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 174 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:40,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 539 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-05 16:10:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 944. [2025-02-05 16:10:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 737 states have (on average 1.3419267299864315) internal successors, (989), 751 states have internal predecessors, (989), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-02-05 16:10:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1267 transitions. [2025-02-05 16:10:40,563 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1267 transitions. Word has length 264 [2025-02-05 16:10:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:40,564 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1267 transitions. [2025-02-05 16:10:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 16:10:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1267 transitions. [2025-02-05 16:10:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 16:10:40,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:40,566 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:40,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:10:40,567 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:40,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1123431227, now seen corresponding path program 1 times [2025-02-05 16:10:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534520933] [2025-02-05 16:10:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:40,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 16:10:40,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 16:10:40,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:40,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-02-05 16:10:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534520933] [2025-02-05 16:10:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534520933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276055824] [2025-02-05 16:10:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:40,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:40,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:40,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:40,648 INFO L87 Difference]: Start difference. First operand 944 states and 1267 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 16:10:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:40,742 INFO L93 Difference]: Finished difference Result 2204 states and 3029 transitions. [2025-02-05 16:10:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 265 [2025-02-05 16:10:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:40,753 INFO L225 Difference]: With dead ends: 2204 [2025-02-05 16:10:40,753 INFO L226 Difference]: Without dead ends: 1528 [2025-02-05 16:10:40,755 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-02-05 16:10:40,756 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 175 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:40,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 556 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-02-05 16:10:40,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1514. [2025-02-05 16:10:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1175 states have (on average 1.3659574468085107) internal successors, (1605), 1203 states have internal predecessors, (1605), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-05 16:10:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2067 transitions. [2025-02-05 16:10:40,842 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2067 transitions. Word has length 265 [2025-02-05 16:10:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:40,842 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2067 transitions. [2025-02-05 16:10:40,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 16:10:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2067 transitions. [2025-02-05 16:10:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 16:10:40,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:40,844 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:40,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:10:40,845 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 826869028, now seen corresponding path program 1 times [2025-02-05 16:10:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736102719] [2025-02-05 16:10:40,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:40,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 16:10:40,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 16:10:40,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:40,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-02-05 16:10:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736102719] [2025-02-05 16:10:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736102719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320179531] [2025-02-05 16:10:41,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:41,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:41,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:41,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:10:41,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 16:10:41,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 16:10:41,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:41,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:41,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:10:41,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-02-05 16:10:41,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320179531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:41,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:41,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-05 16:10:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106728661] [2025-02-05 16:10:41,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:41,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:41,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:41,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:10:41,263 INFO L87 Difference]: Start difference. First operand 1514 states and 2067 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 16:10:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:41,441 INFO L93 Difference]: Finished difference Result 2800 states and 3878 transitions. [2025-02-05 16:10:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 265 [2025-02-05 16:10:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:41,457 INFO L225 Difference]: With dead ends: 2800 [2025-02-05 16:10:41,461 INFO L226 Difference]: Without dead ends: 1514 [2025-02-05 16:10:41,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:10:41,469 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 31 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:41,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 682 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-02-05 16:10:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2025-02-05 16:10:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1175 states have (on average 1.3455319148936171) internal successors, (1581), 1203 states have internal predecessors, (1581), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-05 16:10:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2043 transitions. [2025-02-05 16:10:41,574 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2043 transitions. Word has length 265 [2025-02-05 16:10:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:41,574 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2043 transitions. [2025-02-05 16:10:41,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 16:10:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2043 transitions. [2025-02-05 16:10:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 16:10:41,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:41,576 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:41,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:41,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:41,779 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2023721683, now seen corresponding path program 1 times [2025-02-05 16:10:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:41,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477659921] [2025-02-05 16:10:41,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 16:10:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 16:10:41,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-05 16:10:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477659921] [2025-02-05 16:10:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477659921] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595214922] [2025-02-05 16:10:41,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:41,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:41,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:10:42,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 16:10:42,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 16:10:42,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:42,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:42,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:10:42,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-02-05 16:10:42,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595214922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:42,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:42,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-05 16:10:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653779555] [2025-02-05 16:10:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:42,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:42,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:42,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:10:42,167 INFO L87 Difference]: Start difference. First operand 1514 states and 2043 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 16:10:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:42,258 INFO L93 Difference]: Finished difference Result 2800 states and 3822 transitions. [2025-02-05 16:10:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2025-02-05 16:10:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:42,265 INFO L225 Difference]: With dead ends: 2800 [2025-02-05 16:10:42,265 INFO L226 Difference]: Without dead ends: 1562 [2025-02-05 16:10:42,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:10:42,268 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 7 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:42,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 690 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-02-05 16:10:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1562. [2025-02-05 16:10:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1215 states have (on average 1.3473251028806585) internal successors, (1637), 1243 states have internal predecessors, (1637), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-05 16:10:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2099 transitions. [2025-02-05 16:10:42,325 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2099 transitions. Word has length 266 [2025-02-05 16:10:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:42,325 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2099 transitions. [2025-02-05 16:10:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 16:10:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2099 transitions. [2025-02-05 16:10:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-05 16:10:42,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:42,327 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 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, 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] [2025-02-05 16:10:42,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 16:10:42,528 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1529502310, now seen corresponding path program 1 times [2025-02-05 16:10:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196906314] [2025-02-05 16:10:42,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:42,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-05 16:10:42,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-05 16:10:42,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:42,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-02-05 16:10:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196906314] [2025-02-05 16:10:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196906314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:10:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9773824] [2025-02-05 16:10:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:42,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:42,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:42,851 INFO L87 Difference]: Start difference. First operand 1562 states and 2099 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-05 16:10:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:42,956 INFO L93 Difference]: Finished difference Result 2384 states and 3430 transitions. [2025-02-05 16:10:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:10:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 267 [2025-02-05 16:10:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:42,966 INFO L225 Difference]: With dead ends: 2384 [2025-02-05 16:10:42,966 INFO L226 Difference]: Without dead ends: 2382 [2025-02-05 16:10:42,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:10:42,968 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 114 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:42,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1777 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2025-02-05 16:10:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1610. [2025-02-05 16:10:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1247 states have (on average 1.33841218925421) internal successors, (1669), 1283 states have internal predecessors, (1669), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2025-02-05 16:10:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2147 transitions. [2025-02-05 16:10:43,087 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2147 transitions. Word has length 267 [2025-02-05 16:10:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:43,087 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2147 transitions. [2025-02-05 16:10:43,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-05 16:10:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2147 transitions. [2025-02-05 16:10:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 16:10:43,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:43,090 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:43,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:10:43,090 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:43,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1756260798, now seen corresponding path program 1 times [2025-02-05 16:10:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:43,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719244396] [2025-02-05 16:10:43,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:43,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:43,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 16:10:43,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 16:10:43,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:43,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-02-05 16:10:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719244396] [2025-02-05 16:10:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719244396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934750988] [2025-02-05 16:10:43,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:43,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:43,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:43,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:10:43,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 16:10:43,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 16:10:43,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:43,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:43,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 16:10:43,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 248 proven. 37 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-02-05 16:10:43,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-02-05 16:10:44,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934750988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:44,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-02-05 16:10:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165974678] [2025-02-05 16:10:44,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 16:10:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:44,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 16:10:44,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:44,059 INFO L87 Difference]: Start difference. First operand 1610 states and 2147 transitions. Second operand has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-02-05 16:10:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:44,598 INFO L93 Difference]: Finished difference Result 3957 states and 5467 transitions. [2025-02-05 16:10:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:10:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 275 [2025-02-05 16:10:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:44,611 INFO L225 Difference]: With dead ends: 3957 [2025-02-05 16:10:44,611 INFO L226 Difference]: Without dead ends: 2623 [2025-02-05 16:10:44,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 541 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:10:44,619 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 218 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:44,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 3684 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:10:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-02-05 16:10:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2403. [2025-02-05 16:10:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 1857 states have (on average 1.3295638126009692) internal successors, (2469), 1909 states have internal predecessors, (2469), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2025-02-05 16:10:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3189 transitions. [2025-02-05 16:10:44,733 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3189 transitions. Word has length 275 [2025-02-05 16:10:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 3189 transitions. [2025-02-05 16:10:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-02-05 16:10:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3189 transitions. [2025-02-05 16:10:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 16:10:44,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:44,738 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:44,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 16:10:44,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 16:10:44,939 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -794646781, now seen corresponding path program 1 times [2025-02-05 16:10:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90089969] [2025-02-05 16:10:44,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:44,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 16:10:44,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 16:10:44,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-02-05 16:10:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:45,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90089969] [2025-02-05 16:10:45,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90089969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:45,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602769422] [2025-02-05 16:10:45,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:45,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:45,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:45,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:10:45,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 16:10:45,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 16:10:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:45,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:10:45,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-02-05 16:10:45,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602769422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:45,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-05 16:10:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663175549] [2025-02-05 16:10:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:45,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:45,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:45,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:45,252 INFO L87 Difference]: Start difference. First operand 2403 states and 3189 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 16:10:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:45,368 INFO L93 Difference]: Finished difference Result 4642 states and 6257 transitions. [2025-02-05 16:10:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 275 [2025-02-05 16:10:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:45,379 INFO L225 Difference]: With dead ends: 4642 [2025-02-05 16:10:45,379 INFO L226 Difference]: Without dead ends: 2339 [2025-02-05 16:10:45,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:45,385 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:45,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 690 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2025-02-05 16:10:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2339. [2025-02-05 16:10:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1813 states have (on average 1.3121897407611693) internal successors, (2379), 1865 states have internal predecessors, (2379), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2025-02-05 16:10:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3063 transitions. [2025-02-05 16:10:45,476 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3063 transitions. Word has length 275 [2025-02-05 16:10:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:45,478 INFO L471 AbstractCegarLoop]: Abstraction has 2339 states and 3063 transitions. [2025-02-05 16:10:45,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 16:10:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3063 transitions. [2025-02-05 16:10:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 16:10:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:45,482 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2025-02-05 16:10:45,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:10:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:45,683 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:45,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1323132970, now seen corresponding path program 1 times [2025-02-05 16:10:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492236097] [2025-02-05 16:10:45,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:45,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 16:10:45,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 16:10:45,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:45,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-02-05 16:10:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492236097] [2025-02-05 16:10:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492236097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271648914] [2025-02-05 16:10:45,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:45,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:45,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:45,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:10:45,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 16:10:46,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 16:10:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:46,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:10:46,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-02-05 16:10:46,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271648914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-05 16:10:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004377238] [2025-02-05 16:10:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:46,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:46,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:46,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:46,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:46,052 INFO L87 Difference]: Start difference. First operand 2339 states and 3063 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 16:10:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:46,158 INFO L93 Difference]: Finished difference Result 4425 states and 5899 transitions. [2025-02-05 16:10:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 278 [2025-02-05 16:10:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:46,168 INFO L225 Difference]: With dead ends: 4425 [2025-02-05 16:10:46,168 INFO L226 Difference]: Without dead ends: 2168 [2025-02-05 16:10:46,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:46,173 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 4 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:46,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 718 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2025-02-05 16:10:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2025-02-05 16:10:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1672 states have (on average 1.305622009569378) internal successors, (2183), 1724 states have internal predecessors, (2183), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2025-02-05 16:10:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2829 transitions. [2025-02-05 16:10:46,254 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2829 transitions. Word has length 278 [2025-02-05 16:10:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:46,254 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2829 transitions. [2025-02-05 16:10:46,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 16:10:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2829 transitions. [2025-02-05 16:10:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-02-05 16:10:46,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:46,257 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 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] [2025-02-05 16:10:46,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:46,458 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -867863680, now seen corresponding path program 1 times [2025-02-05 16:10:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399036357] [2025-02-05 16:10:46,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:46,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-02-05 16:10:46,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-02-05 16:10:46,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:46,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-02-05 16:10:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399036357] [2025-02-05 16:10:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399036357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636865144] [2025-02-05 16:10:46,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:46,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:46,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:46,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:46,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:10:46,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-02-05 16:10:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-02-05 16:10:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:46,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 16:10:46,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-02-05 16:10:47,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636865144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-05 16:10:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074623977] [2025-02-05 16:10:47,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:47,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:10:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:47,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:10:47,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:47,032 INFO L87 Difference]: Start difference. First operand 2168 states and 2829 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:10:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:47,630 INFO L93 Difference]: Finished difference Result 7054 states and 9183 transitions. [2025-02-05 16:10:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:10:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 290 [2025-02-05 16:10:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:47,650 INFO L225 Difference]: With dead ends: 7054 [2025-02-05 16:10:47,651 INFO L226 Difference]: Without dead ends: 5456 [2025-02-05 16:10:47,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:10:47,654 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 625 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:47,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2665 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:10:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-02-05 16:10:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5184. [2025-02-05 16:10:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 3965 states have (on average 1.2953341740226987) internal successors, (5136), 4093 states have internal predecessors, (5136), 787 states have call successors, (787), 431 states have call predecessors, (787), 431 states have return successors, (787), 667 states have call predecessors, (787), 787 states have call successors, (787) [2025-02-05 16:10:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 6710 transitions. [2025-02-05 16:10:47,851 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 6710 transitions. Word has length 290 [2025-02-05 16:10:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:47,851 INFO L471 AbstractCegarLoop]: Abstraction has 5184 states and 6710 transitions. [2025-02-05 16:10:47,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:10:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 6710 transitions. [2025-02-05 16:10:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 16:10:47,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:47,855 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 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, 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] [2025-02-05 16:10:47,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:48,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:48,057 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:48,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash -870432931, now seen corresponding path program 1 times [2025-02-05 16:10:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:48,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761734616] [2025-02-05 16:10:48,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:48,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 16:10:48,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 16:10:48,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:48,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-02-05 16:10:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761734616] [2025-02-05 16:10:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761734616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:10:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338396951] [2025-02-05 16:10:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:48,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:48,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:48,233 INFO L87 Difference]: Start difference. First operand 5184 states and 6710 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:10:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:48,399 INFO L93 Difference]: Finished difference Result 10398 states and 13723 transitions. [2025-02-05 16:10:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:10:48,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 296 [2025-02-05 16:10:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:48,424 INFO L225 Difference]: With dead ends: 10398 [2025-02-05 16:10:48,424 INFO L226 Difference]: Without dead ends: 5724 [2025-02-05 16:10:48,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:48,434 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 37 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:48,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1014 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2025-02-05 16:10:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5616. [2025-02-05 16:10:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5616 states, 4313 states have (on average 1.3058196151170878) internal successors, (5632), 4441 states have internal predecessors, (5632), 871 states have call successors, (871), 431 states have call predecessors, (871), 431 states have return successors, (871), 751 states have call predecessors, (871), 871 states have call successors, (871) [2025-02-05 16:10:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5616 states to 5616 states and 7374 transitions. [2025-02-05 16:10:48,762 INFO L78 Accepts]: Start accepts. Automaton has 5616 states and 7374 transitions. Word has length 296 [2025-02-05 16:10:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:48,762 INFO L471 AbstractCegarLoop]: Abstraction has 5616 states and 7374 transitions. [2025-02-05 16:10:48,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:10:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5616 states and 7374 transitions. [2025-02-05 16:10:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 16:10:48,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:48,765 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 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, 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] [2025-02-05 16:10:48,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:10:48,765 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:48,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 361843227, now seen corresponding path program 1 times [2025-02-05 16:10:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:48,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985243638] [2025-02-05 16:10:48,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:48,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 16:10:48,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 16:10:48,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:48,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-02-05 16:10:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985243638] [2025-02-05 16:10:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985243638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111505483] [2025-02-05 16:10:49,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:49,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:49,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:49,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 16:10:49,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 16:10:49,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 16:10:49,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:49,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:49,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 16:10:49,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-02-05 16:10:49,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111505483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 13 [2025-02-05 16:10:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693289943] [2025-02-05 16:10:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:49,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:10:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:49,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:10:49,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:10:49,399 INFO L87 Difference]: Start difference. First operand 5616 states and 7374 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:10:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:50,110 INFO L93 Difference]: Finished difference Result 14502 states and 18903 transitions. [2025-02-05 16:10:50,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:10:50,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 296 [2025-02-05 16:10:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:50,138 INFO L225 Difference]: With dead ends: 14502 [2025-02-05 16:10:50,139 INFO L226 Difference]: Without dead ends: 9400 [2025-02-05 16:10:50,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:10:50,149 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 618 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:50,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2697 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:10:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2025-02-05 16:10:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 6780. [2025-02-05 16:10:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6780 states, 5193 states have (on average 1.2998266897746966) internal successors, (6750), 5353 states have internal predecessors, (6750), 1059 states have call successors, (1059), 527 states have call predecessors, (1059), 527 states have return successors, (1059), 907 states have call predecessors, (1059), 1059 states have call successors, (1059) [2025-02-05 16:10:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6780 states to 6780 states and 8868 transitions. [2025-02-05 16:10:50,506 INFO L78 Accepts]: Start accepts. Automaton has 6780 states and 8868 transitions. Word has length 296 [2025-02-05 16:10:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:50,507 INFO L471 AbstractCegarLoop]: Abstraction has 6780 states and 8868 transitions. [2025-02-05 16:10:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:10:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6780 states and 8868 transitions. [2025-02-05 16:10:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 16:10:50,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:50,510 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 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, 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] [2025-02-05 16:10:50,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:50,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:50,710 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:50,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 805370651, now seen corresponding path program 1 times [2025-02-05 16:10:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:50,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673678450] [2025-02-05 16:10:50,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:50,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 16:10:50,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 16:10:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-02-05 16:10:50,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673678450] [2025-02-05 16:10:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673678450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722076589] [2025-02-05 16:10:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:50,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:50,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:50,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:50,972 INFO L87 Difference]: Start difference. First operand 6780 states and 8868 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 16:10:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:51,288 INFO L93 Difference]: Finished difference Result 12533 states and 16454 transitions. [2025-02-05 16:10:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 296 [2025-02-05 16:10:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:51,312 INFO L225 Difference]: With dead ends: 12533 [2025-02-05 16:10:51,313 INFO L226 Difference]: Without dead ends: 6665 [2025-02-05 16:10:51,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 16:10:51,327 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:51,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 957 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2025-02-05 16:10:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6665. [2025-02-05 16:10:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 5097 states have (on average 1.2982146360604276) internal successors, (6617), 5247 states have internal predecessors, (6617), 1050 states have call successors, (1050), 518 states have call predecessors, (1050), 517 states have return successors, (1049), 906 states have call predecessors, (1049), 1049 states have call successors, (1049) [2025-02-05 16:10:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 8716 transitions. [2025-02-05 16:10:51,727 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 8716 transitions. Word has length 296 [2025-02-05 16:10:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:51,728 INFO L471 AbstractCegarLoop]: Abstraction has 6665 states and 8716 transitions. [2025-02-05 16:10:51,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 16:10:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 8716 transitions. [2025-02-05 16:10:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 16:10:51,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:51,732 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 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, 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] [2025-02-05 16:10:51,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:10:51,733 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:51,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1190067036, now seen corresponding path program 1 times [2025-02-05 16:10:51,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:51,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381214666] [2025-02-05 16:10:51,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:51,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:51,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 16:10:51,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 16:10:51,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:51,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-02-05 16:10:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381214666] [2025-02-05 16:10:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381214666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642540949] [2025-02-05 16:10:52,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:52,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:52,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:52,441 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:52,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 16:10:52,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 16:10:52,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 16:10:52,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:52,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:52,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:10:52,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-02-05 16:10:52,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642540949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:52,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:52,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-02-05 16:10:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752975946] [2025-02-05 16:10:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:10:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:52,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:10:52,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:52,763 INFO L87 Difference]: Start difference. First operand 6665 states and 8716 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 16:10:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:53,178 INFO L93 Difference]: Finished difference Result 13821 states and 18122 transitions. [2025-02-05 16:10:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:10:53,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 301 [2025-02-05 16:10:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:53,206 INFO L225 Difference]: With dead ends: 13821 [2025-02-05 16:10:53,206 INFO L226 Difference]: Without dead ends: 8237 [2025-02-05 16:10:53,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:10:53,217 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 124 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:53,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1867 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:10:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2025-02-05 16:10:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 7227. [2025-02-05 16:10:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7227 states, 5525 states have (on average 1.2982805429864253) internal successors, (7173), 5679 states have internal predecessors, (7173), 1141 states have call successors, (1141), 561 states have call predecessors, (1141), 560 states have return successors, (1140), 986 states have call predecessors, (1140), 1140 states have call successors, (1140) [2025-02-05 16:10:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7227 states to 7227 states and 9454 transitions. [2025-02-05 16:10:53,560 INFO L78 Accepts]: Start accepts. Automaton has 7227 states and 9454 transitions. Word has length 301 [2025-02-05 16:10:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 7227 states and 9454 transitions. [2025-02-05 16:10:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 16:10:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7227 states and 9454 transitions. [2025-02-05 16:10:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 16:10:53,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:53,564 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 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, 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] [2025-02-05 16:10:53,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 16:10:53,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-05 16:10:53,764 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:53,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash 552339587, now seen corresponding path program 1 times [2025-02-05 16:10:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351815941] [2025-02-05 16:10:53,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:53,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 16:10:53,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 16:10:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:53,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-02-05 16:10:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351815941] [2025-02-05 16:10:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351815941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053369947] [2025-02-05 16:10:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:53,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:53,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:53,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:53,881 INFO L87 Difference]: Start difference. First operand 7227 states and 9454 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-05 16:10:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:54,179 INFO L93 Difference]: Finished difference Result 13357 states and 17546 transitions. [2025-02-05 16:10:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 301 [2025-02-05 16:10:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:54,204 INFO L225 Difference]: With dead ends: 13357 [2025-02-05 16:10:54,204 INFO L226 Difference]: Without dead ends: 6909 [2025-02-05 16:10:54,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:54,218 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 253 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:54,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 690 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2025-02-05 16:10:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6661. [2025-02-05 16:10:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 5092 states have (on average 1.3002749410840535) internal successors, (6621), 5231 states have internal predecessors, (6621), 1054 states have call successors, (1054), 515 states have call predecessors, (1054), 514 states have return successors, (1053), 914 states have call predecessors, (1053), 1053 states have call successors, (1053) [2025-02-05 16:10:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 8728 transitions. [2025-02-05 16:10:54,455 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 8728 transitions. Word has length 301 [2025-02-05 16:10:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:54,455 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 8728 transitions. [2025-02-05 16:10:54,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-05 16:10:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 8728 transitions. [2025-02-05 16:10:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 16:10:54,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:54,458 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2025-02-05 16:10:54,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:10:54,458 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -570581356, now seen corresponding path program 1 times [2025-02-05 16:10:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702759824] [2025-02-05 16:10:54,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:54,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 16:10:54,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 16:10:54,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:54,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-02-05 16:10:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702759824] [2025-02-05 16:10:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702759824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622084940] [2025-02-05 16:10:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:54,616 INFO L87 Difference]: Start difference. First operand 6661 states and 8728 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:10:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:54,965 INFO L93 Difference]: Finished difference Result 11449 states and 15005 transitions. [2025-02-05 16:10:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:54,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 307 [2025-02-05 16:10:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:54,986 INFO L225 Difference]: With dead ends: 11449 [2025-02-05 16:10:54,986 INFO L226 Difference]: Without dead ends: 5564 [2025-02-05 16:10:54,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:54,995 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 428 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:54,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 915 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:10:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5564 states. [2025-02-05 16:10:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5564 to 5310. [2025-02-05 16:10:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5310 states, 4068 states have (on average 1.2763028515240904) internal successors, (5192), 4177 states have internal predecessors, (5192), 828 states have call successors, (828), 413 states have call predecessors, (828), 413 states have return successors, (828), 719 states have call predecessors, (828), 828 states have call successors, (828) [2025-02-05 16:10:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5310 states to 5310 states and 6848 transitions. [2025-02-05 16:10:55,201 INFO L78 Accepts]: Start accepts. Automaton has 5310 states and 6848 transitions. Word has length 307 [2025-02-05 16:10:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:55,201 INFO L471 AbstractCegarLoop]: Abstraction has 5310 states and 6848 transitions. [2025-02-05 16:10:55,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:10:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5310 states and 6848 transitions. [2025-02-05 16:10:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-05 16:10:55,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:55,209 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:10:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:10:55,209 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1308381069, now seen corresponding path program 1 times [2025-02-05 16:10:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689026004] [2025-02-05 16:10:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:55,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-05 16:10:55,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-05 16:10:55,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:55,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 16:10:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689026004] [2025-02-05 16:10:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689026004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:56,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:10:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421370118] [2025-02-05 16:10:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:10:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:56,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:10:56,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:10:56,153 INFO L87 Difference]: Start difference. First operand 5310 states and 6848 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 6 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 16:10:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:56,625 INFO L93 Difference]: Finished difference Result 11941 states and 15320 transitions. [2025-02-05 16:10:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 6 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 357 [2025-02-05 16:10:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:56,651 INFO L225 Difference]: With dead ends: 11941 [2025-02-05 16:10:56,651 INFO L226 Difference]: Without dead ends: 7414 [2025-02-05 16:10:56,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:56,661 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 76 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:56,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1719 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7414 states. [2025-02-05 16:10:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7414 to 6886. [2025-02-05 16:10:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 5260 states have (on average 1.2653992395437261) internal successors, (6656), 5397 states have internal predecessors, (6656), 1032 states have call successors, (1032), 541 states have call predecessors, (1032), 593 states have return successors, (1108), 947 states have call predecessors, (1108), 1032 states have call successors, (1108) [2025-02-05 16:10:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 8796 transitions. [2025-02-05 16:10:57,013 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 8796 transitions. Word has length 357 [2025-02-05 16:10:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 6886 states and 8796 transitions. [2025-02-05 16:10:57,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 6 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 16:10:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 8796 transitions. [2025-02-05 16:10:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-05 16:10:57,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:57,024 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:10:57,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:10:57,024 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1504894574, now seen corresponding path program 1 times [2025-02-05 16:10:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417394874] [2025-02-05 16:10:57,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-05 16:10:57,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-05 16:10:57,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:57,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2025-02-05 16:10:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417394874] [2025-02-05 16:10:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417394874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802524925] [2025-02-05 16:10:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:57,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:57,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:57,131 INFO L87 Difference]: Start difference. First operand 6886 states and 8796 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:10:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:57,390 INFO L93 Difference]: Finished difference Result 13917 states and 17743 transitions. [2025-02-05 16:10:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 357 [2025-02-05 16:10:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:57,414 INFO L225 Difference]: With dead ends: 13917 [2025-02-05 16:10:57,414 INFO L226 Difference]: Without dead ends: 6678 [2025-02-05 16:10:57,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:57,425 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 26 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:57,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 661 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6678 states. [2025-02-05 16:10:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6678 to 6678. [2025-02-05 16:10:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6678 states, 5104 states have (on average 1.2274686520376175) internal successors, (6265), 5241 states have internal predecessors, (6265), 1032 states have call successors, (1032), 541 states have call predecessors, (1032), 541 states have return successors, (1032), 895 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-02-05 16:10:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6678 states to 6678 states and 8329 transitions. [2025-02-05 16:10:57,678 INFO L78 Accepts]: Start accepts. Automaton has 6678 states and 8329 transitions. Word has length 357 [2025-02-05 16:10:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 6678 states and 8329 transitions. [2025-02-05 16:10:57,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:10:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6678 states and 8329 transitions. [2025-02-05 16:10:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-05 16:10:57,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:57,690 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:10:57,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:10:57,690 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1723307802, now seen corresponding path program 1 times [2025-02-05 16:10:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588630614] [2025-02-05 16:10:57,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:57,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-05 16:10:57,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-05 16:10:57,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:57,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-02-05 16:10:58,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:58,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588630614] [2025-02-05 16:10:58,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588630614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:58,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462442918] [2025-02-05 16:10:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:58,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:58,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:58,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:58,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 16:10:58,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-05 16:10:58,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-05 16:10:58,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:58,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:58,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 16:10:58,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-02-05 16:10:59,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-02-05 16:10:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462442918] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:59,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:59,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 12] total 21 [2025-02-05 16:10:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50443572] [2025-02-05 16:10:59,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:59,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 16:10:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:59,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 16:10:59,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:10:59,478 INFO L87 Difference]: Start difference. First operand 6678 states and 8329 transitions. Second operand has 21 states, 20 states have (on average 13.25) internal successors, (265), 20 states have internal predecessors, (265), 14 states have call successors, (64), 7 states have call predecessors, (64), 6 states have return successors, (62), 13 states have call predecessors, (62), 13 states have call successors, (62) [2025-02-05 16:11:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:05,009 INFO L93 Difference]: Finished difference Result 36198 states and 48423 transitions. [2025-02-05 16:11:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-02-05 16:11:05,010 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 13.25) internal successors, (265), 20 states have internal predecessors, (265), 14 states have call successors, (64), 7 states have call predecessors, (64), 6 states have return successors, (62), 13 states have call predecessors, (62), 13 states have call successors, (62) Word has length 367 [2025-02-05 16:11:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:05,130 INFO L225 Difference]: With dead ends: 36198 [2025-02-05 16:11:05,131 INFO L226 Difference]: Without dead ends: 30375 [2025-02-05 16:11:05,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 745 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1614, Invalid=9728, Unknown=0, NotChecked=0, Total=11342 [2025-02-05 16:11:05,149 INFO L435 NwaCegarLoop]: 1092 mSDtfsCounter, 3011 mSDsluCounter, 9507 mSDsCounter, 0 mSdLazyCounter, 4709 mSolverCounterSat, 859 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3011 SdHoareTripleChecker+Valid, 10599 SdHoareTripleChecker+Invalid, 5568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 859 IncrementalHoareTripleChecker+Valid, 4709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:05,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3011 Valid, 10599 Invalid, 5568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [859 Valid, 4709 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 16:11:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30375 states. [2025-02-05 16:11:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30375 to 7408. [2025-02-05 16:11:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7408 states, 5684 states have (on average 1.2285362420830401) internal successors, (6983), 5886 states have internal predecessors, (6983), 1124 states have call successors, (1124), 599 states have call predecessors, (1124), 599 states have return successors, (1124), 922 states have call predecessors, (1124), 1124 states have call successors, (1124) [2025-02-05 16:11:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 9231 transitions. [2025-02-05 16:11:06,249 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 9231 transitions. Word has length 367 [2025-02-05 16:11:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:06,249 INFO L471 AbstractCegarLoop]: Abstraction has 7408 states and 9231 transitions. [2025-02-05 16:11:06,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.25) internal successors, (265), 20 states have internal predecessors, (265), 14 states have call successors, (64), 7 states have call predecessors, (64), 6 states have return successors, (62), 13 states have call predecessors, (62), 13 states have call successors, (62) [2025-02-05 16:11:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 9231 transitions. [2025-02-05 16:11:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-05 16:11:06,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:06,274 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:11:06,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 16:11:06,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-02-05 16:11:06,481 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:06,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash 556611483, now seen corresponding path program 1 times [2025-02-05 16:11:06,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:06,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327430178] [2025-02-05 16:11:06,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:06,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-05 16:11:06,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-05 16:11:06,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2025-02-05 16:11:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:06,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327430178] [2025-02-05 16:11:06,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327430178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:06,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:11:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092761007] [2025-02-05 16:11:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:11:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:11:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:11:06,871 INFO L87 Difference]: Start difference. First operand 7408 states and 9231 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 16:11:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:07,678 INFO L93 Difference]: Finished difference Result 13904 states and 17471 transitions. [2025-02-05 16:11:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:11:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 367 [2025-02-05 16:11:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:07,699 INFO L225 Difference]: With dead ends: 13904 [2025-02-05 16:11:07,699 INFO L226 Difference]: Without dead ends: 7459 [2025-02-05 16:11:07,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:11:07,709 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 150 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:07,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2265 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:11:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2025-02-05 16:11:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 6544. [2025-02-05 16:11:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6544 states, 5012 states have (on average 1.2304469273743017) internal successors, (6167), 5214 states have internal predecessors, (6167), 1004 states have call successors, (1004), 527 states have call predecessors, (1004), 527 states have return successors, (1004), 802 states have call predecessors, (1004), 1004 states have call successors, (1004) [2025-02-05 16:11:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6544 states to 6544 states and 8175 transitions. [2025-02-05 16:11:08,250 INFO L78 Accepts]: Start accepts. Automaton has 6544 states and 8175 transitions. Word has length 367 [2025-02-05 16:11:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 6544 states and 8175 transitions. [2025-02-05 16:11:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 16:11:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 6544 states and 8175 transitions. [2025-02-05 16:11:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-05 16:11:08,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:08,260 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:11:08,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:11:08,260 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:08,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 272279756, now seen corresponding path program 1 times [2025-02-05 16:11:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303209720] [2025-02-05 16:11:08,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:08,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 16:11:08,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 16:11:08,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:08,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-02-05 16:11:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303209720] [2025-02-05 16:11:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303209720] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924933335] [2025-02-05 16:11:09,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:09,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:09,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:09,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 16:11:09,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 16:11:09,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 16:11:09,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:09,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:09,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 16:11:09,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 303 proven. 70 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-02-05 16:11:10,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-02-05 16:11:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924933335] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:10,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 29 [2025-02-05 16:11:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385077840] [2025-02-05 16:11:10,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:10,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:11:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:10,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:11:10,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:11:10,622 INFO L87 Difference]: Start difference. First operand 6544 states and 8175 transitions. Second operand has 29 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 19 states have call successors, (76), 7 states have call predecessors, (76), 6 states have return successors, (74), 18 states have call predecessors, (74), 18 states have call successors, (74) [2025-02-05 16:11:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:36,639 INFO L93 Difference]: Finished difference Result 111290 states and 152020 transitions. [2025-02-05 16:11:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2025-02-05 16:11:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 19 states have call successors, (76), 7 states have call predecessors, (76), 6 states have return successors, (74), 18 states have call predecessors, (74), 18 states have call successors, (74) Word has length 368 [2025-02-05 16:11:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:37,282 INFO L225 Difference]: With dead ends: 111290 [2025-02-05 16:11:37,282 INFO L226 Difference]: Without dead ends: 105709 [2025-02-05 16:11:37,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1279 GetRequests, 828 SyntacticMatches, 0 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94610 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=17734, Invalid=187022, Unknown=0, NotChecked=0, Total=204756 [2025-02-05 16:11:37,359 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 15527 mSDsluCounter, 15724 mSDsCounter, 0 mSdLazyCounter, 8495 mSolverCounterSat, 5534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15527 SdHoareTripleChecker+Valid, 17247 SdHoareTripleChecker+Invalid, 14029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5534 IncrementalHoareTripleChecker+Valid, 8495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:37,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15527 Valid, 17247 Invalid, 14029 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5534 Valid, 8495 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-02-05 16:11:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105709 states. [2025-02-05 16:11:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105709 to 8164. [2025-02-05 16:11:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8164 states, 6259 states have (on average 1.2228790541620067) internal successors, (7654), 6530 states have internal predecessors, (7654), 1244 states have call successors, (1244), 660 states have call predecessors, (1244), 660 states have return successors, (1244), 973 states have call predecessors, (1244), 1244 states have call successors, (1244) [2025-02-05 16:11:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10142 transitions. [2025-02-05 16:11:40,130 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10142 transitions. Word has length 368 [2025-02-05 16:11:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:40,131 INFO L471 AbstractCegarLoop]: Abstraction has 8164 states and 10142 transitions. [2025-02-05 16:11:40,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 19 states have call successors, (76), 7 states have call predecessors, (76), 6 states have return successors, (74), 18 states have call predecessors, (74), 18 states have call successors, (74) [2025-02-05 16:11:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10142 transitions. [2025-02-05 16:11:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-05 16:11:40,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:40,144 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:11:40,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 16:11:40,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:40,348 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:40,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -921099537, now seen corresponding path program 1 times [2025-02-05 16:11:40,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:40,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242121264] [2025-02-05 16:11:40,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:40,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-05 16:11:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-05 16:11:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:11:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242121264] [2025-02-05 16:11:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242121264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176075254] [2025-02-05 16:11:41,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:41,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:41,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:41,238 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:41,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 16:11:41,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-05 16:11:41,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-05 16:11:41,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:41,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:41,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 16:11:41,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 260 proven. 116 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-02-05 16:11:42,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:11:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176075254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:42,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 39 [2025-02-05 16:11:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750047695] [2025-02-05 16:11:42,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:42,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 16:11:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:42,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 16:11:42,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1333, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 16:11:42,771 INFO L87 Difference]: Start difference. First operand 8164 states and 10142 transitions. Second operand has 39 states, 38 states have (on average 8.81578947368421) internal successors, (335), 36 states have internal predecessors, (335), 18 states have call successors, (76), 7 states have call predecessors, (76), 9 states have return successors, (75), 19 states have call predecessors, (75), 17 states have call successors, (75)