./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i -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 e22f36fcb48e37029a5451272d2b65f2136f0249698c819249f45360edf16ac5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:03:15,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:03:15,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:03:15,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:03:15,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:03:15,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:03:15,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:03:15,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:03:15,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:03:15,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:03:15,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:03:15,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:03:15,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:03:15,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:03:15,957 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:03:15,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:03:15,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:03:15,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:03:15,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:03:15,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:03:15,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:03:15,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:03:15,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:03:15,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:03:15,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:03:15,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:03:15,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:03:15,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:03:15,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:03:15,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:03:15,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:03:15,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:03:15,961 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 -> e22f36fcb48e37029a5451272d2b65f2136f0249698c819249f45360edf16ac5 [2025-01-09 13:03:16,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:03:16,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:03:16,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:03:16,180 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:03:16,180 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:03:16,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i [2025-01-09 13:03:17,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aa30115d/7cdb3c9ede9f45d897b9f4b2c6dde704/FLAGd2a50ed78 [2025-01-09 13:03:17,586 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:03:17,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i [2025-01-09 13:03:17,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aa30115d/7cdb3c9ede9f45d897b9f4b2c6dde704/FLAGd2a50ed78 [2025-01-09 13:03:17,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aa30115d/7cdb3c9ede9f45d897b9f4b2c6dde704 [2025-01-09 13:03:17,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:03:17,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:03:17,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:03:17,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:03:17,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:03:17,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:03:17" (1/1) ... [2025-01-09 13:03:17,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a133c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:17, skipping insertion in model container [2025-01-09 13:03:17,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:03:17" (1/1) ... [2025-01-09 13:03:17,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:03:18,024 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i[916,929] [2025-01-09 13:03:18,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:03:18,124 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:03:18,131 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i[916,929] [2025-01-09 13:03:18,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:03:18,189 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:03:18,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18 WrapperNode [2025-01-09 13:03:18,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:03:18,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:03:18,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:03:18,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:03:18,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,248 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-01-09 13:03:18,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:03:18,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:03:18,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:03:18,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:03:18,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,289 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-01-09 13:03:18,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:03:18,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:03:18,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:03:18,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:03:18,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (1/1) ... [2025-01-09 13:03:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:03:18,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:03:18,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-01-09 13:03:18,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-01-09 13:03:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:03:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:03:18,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:03:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:03:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:03:18,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:03:18,448 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:03:18,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:03:18,855 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 13:03:18,855 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:03:18,863 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:03:18,864 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:03:18,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:03:18 BoogieIcfgContainer [2025-01-09 13:03:18,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:03:18,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:03:18,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:03:18,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:03:18,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:03:17" (1/3) ... [2025-01-09 13:03:18,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cf51f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:03:18, skipping insertion in model container [2025-01-09 13:03:18,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:03:18" (2/3) ... [2025-01-09 13:03:18,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cf51f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:03:18, skipping insertion in model container [2025-01-09 13:03:18,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:03:18" (3/3) ... [2025-01-09 13:03:18,873 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-20.i [2025-01-09 13:03:18,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:03:18,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:03:18,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:03:18,944 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;@1f9c885d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:03:18,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:03:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 13:03:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 13:03:18,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:18,960 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:18,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:18,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1564344916, now seen corresponding path program 1 times [2025-01-09 13:03:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:18,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798206112] [2025-01-09 13:03:18,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:19,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 13:03:19,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 13:03:19,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:19,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 13:03:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798206112] [2025-01-09 13:03:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798206112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:03:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72567331] [2025-01-09 13:03:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:19,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:03:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:03:19,288 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-01-09 13:03:19,290 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-01-09 13:03:19,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 13:03:19,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 13:03:19,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:19,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:19,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:03:19,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:03:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 13:03:19,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:03:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72567331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:03:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:03:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036336521] [2025-01-09 13:03:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:19,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:03:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:19,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:03:19,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:03:19,514 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 13:03:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:19,542 INFO L93 Difference]: Finished difference Result 224 states and 382 transitions. [2025-01-09 13:03:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:03:19,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-01-09 13:03:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:19,550 INFO L225 Difference]: With dead ends: 224 [2025-01-09 13:03:19,551 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 13:03:19,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:03:19,558 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:19,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:03:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 13:03:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 13:03:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 13:03:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-01-09 13:03:19,596 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-01-09 13:03:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:19,597 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-01-09 13:03:19,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 13:03:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-01-09 13:03:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 13:03:19,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:19,601 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:19,607 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-01-09 13:03:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:03:19,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -75186854, now seen corresponding path program 1 times [2025-01-09 13:03:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43841728] [2025-01-09 13:03:19,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:19,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 13:03:19,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 13:03:19,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:19,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43841728] [2025-01-09 13:03:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43841728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:03:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725735063] [2025-01-09 13:03:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:20,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:03:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:20,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:03:20,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:03:20,287 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:20,565 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-01-09 13:03:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:03:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 13:03:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:20,570 INFO L225 Difference]: With dead ends: 364 [2025-01-09 13:03:20,571 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 13:03:20,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:03:20,573 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 173 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:20,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 729 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:03:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 13:03:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-01-09 13:03:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 13:03:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-01-09 13:03:20,626 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-01-09 13:03:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-01-09 13:03:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-01-09 13:03:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 13:03:20,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:20,632 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:03:20,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:20,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1240533979, now seen corresponding path program 1 times [2025-01-09 13:03:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713641332] [2025-01-09 13:03:20,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:20,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 13:03:20,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 13:03:20,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713641332] [2025-01-09 13:03:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713641332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:21,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:21,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:03:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485090517] [2025-01-09 13:03:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:21,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:03:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:21,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:03:21,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:03:21,214 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:21,734 INFO L93 Difference]: Finished difference Result 823 states and 1254 transitions. [2025-01-09 13:03:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:03:21,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 13:03:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:21,738 INFO L225 Difference]: With dead ends: 823 [2025-01-09 13:03:21,738 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 13:03:21,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:03:21,743 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 255 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 922 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:03:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 13:03:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 428. [2025-01-09 13:03:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 349 states have (on average 1.4269340974212035) internal successors, (498), 351 states have internal predecessors, (498), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 13:03:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 646 transitions. [2025-01-09 13:03:21,798 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 646 transitions. Word has length 205 [2025-01-09 13:03:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:21,799 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 646 transitions. [2025-01-09 13:03:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 646 transitions. [2025-01-09 13:03:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 13:03:21,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:21,802 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:21,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:03:21,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:21,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2138237765, now seen corresponding path program 1 times [2025-01-09 13:03:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:21,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418218260] [2025-01-09 13:03:21,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 13:03:21,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 13:03:21,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:21,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418218260] [2025-01-09 13:03:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418218260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:23,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:23,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:03:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63636062] [2025-01-09 13:03:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:23,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:03:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:23,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:03:23,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:03:23,257 INFO L87 Difference]: Start difference. First operand 428 states and 646 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:23,890 INFO L93 Difference]: Finished difference Result 1357 states and 2026 transitions. [2025-01-09 13:03:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:03:23,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 13:03:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:23,901 INFO L225 Difference]: With dead ends: 1357 [2025-01-09 13:03:23,901 INFO L226 Difference]: Without dead ends: 932 [2025-01-09 13:03:23,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:03:23,904 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 381 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:23,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 487 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:03:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-01-09 13:03:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 539. [2025-01-09 13:03:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 460 states have (on average 1.458695652173913) internal successors, (671), 462 states have internal predecessors, (671), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 13:03:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 819 transitions. [2025-01-09 13:03:23,950 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 819 transitions. Word has length 206 [2025-01-09 13:03:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:23,950 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 819 transitions. [2025-01-09 13:03:23,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 819 transitions. [2025-01-09 13:03:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 13:03:23,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:23,954 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:03:23,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:23,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 858374087, now seen corresponding path program 1 times [2025-01-09 13:03:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:23,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450596406] [2025-01-09 13:03:23,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:23,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 13:03:24,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 13:03:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450596406] [2025-01-09 13:03:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450596406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:25,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:03:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049426461] [2025-01-09 13:03:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:25,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:03:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:25,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:03:25,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:03:25,198 INFO L87 Difference]: Start difference. First operand 539 states and 819 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:25,922 INFO L93 Difference]: Finished difference Result 1387 states and 2088 transitions. [2025-01-09 13:03:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:03:25,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 13:03:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:25,928 INFO L225 Difference]: With dead ends: 1387 [2025-01-09 13:03:25,929 INFO L226 Difference]: Without dead ends: 851 [2025-01-09 13:03:25,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:03:25,930 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 303 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:25,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 615 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:03:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-01-09 13:03:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 538. [2025-01-09 13:03:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 459 states have (on average 1.457516339869281) internal successors, (669), 461 states have internal predecessors, (669), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 13:03:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 817 transitions. [2025-01-09 13:03:25,970 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 817 transitions. Word has length 206 [2025-01-09 13:03:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:25,970 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 817 transitions. [2025-01-09 13:03:25,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 817 transitions. [2025-01-09 13:03:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 13:03:25,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:25,972 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:25,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:03:25,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:25,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 449294023, now seen corresponding path program 1 times [2025-01-09 13:03:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329999321] [2025-01-09 13:03:25,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 13:03:26,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 13:03:26,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:26,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329999321] [2025-01-09 13:03:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329999321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:03:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416889247] [2025-01-09 13:03:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:03:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:27,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:03:27,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:03:27,356 INFO L87 Difference]: Start difference. First operand 538 states and 817 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:28,732 INFO L93 Difference]: Finished difference Result 1421 states and 2110 transitions. [2025-01-09 13:03:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:03:28,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 13:03:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:28,736 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 13:03:28,736 INFO L226 Difference]: Without dead ends: 886 [2025-01-09 13:03:28,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:03:28,738 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 308 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:28,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 912 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 13:03:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-09 13:03:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 559. [2025-01-09 13:03:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 480 states have (on average 1.4520833333333334) internal successors, (697), 482 states have internal predecessors, (697), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 13:03:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 845 transitions. [2025-01-09 13:03:28,764 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 845 transitions. Word has length 206 [2025-01-09 13:03:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:28,766 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 845 transitions. [2025-01-09 13:03:28,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 845 transitions. [2025-01-09 13:03:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 13:03:28,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:28,770 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:03:28,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:28,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1776388455, now seen corresponding path program 1 times [2025-01-09 13:03:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935770113] [2025-01-09 13:03:28,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:28,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 13:03:28,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 13:03:28,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:28,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:28,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:28,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935770113] [2025-01-09 13:03:28,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935770113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:28,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:28,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:03:28,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826898549] [2025-01-09 13:03:28,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:03:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:28,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:03:28,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:03:28,853 INFO L87 Difference]: Start difference. First operand 559 states and 845 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:28,928 INFO L93 Difference]: Finished difference Result 1381 states and 2097 transitions. [2025-01-09 13:03:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:03:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 13:03:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:28,932 INFO L225 Difference]: With dead ends: 1381 [2025-01-09 13:03:28,932 INFO L226 Difference]: Without dead ends: 825 [2025-01-09 13:03:28,934 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-01-09 13:03:28,934 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 147 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:28,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 456 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:03:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-01-09 13:03:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 678. [2025-01-09 13:03:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 599 states have (on average 1.4707846410684473) internal successors, (881), 601 states have internal predecessors, (881), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 13:03:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1029 transitions. [2025-01-09 13:03:28,964 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1029 transitions. Word has length 206 [2025-01-09 13:03:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:28,964 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1029 transitions. [2025-01-09 13:03:28,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1029 transitions. [2025-01-09 13:03:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 13:03:28,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:28,967 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:28,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:03:28,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:28,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:28,967 INFO L85 PathProgramCache]: Analyzing trace with hash -918871778, now seen corresponding path program 1 times [2025-01-09 13:03:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607862108] [2025-01-09 13:03:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:28,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 13:03:29,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 13:03:29,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:29,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607862108] [2025-01-09 13:03:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607862108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:03:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617867729] [2025-01-09 13:03:29,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:29,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:03:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:29,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:03:29,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:03:29,123 INFO L87 Difference]: Start difference. First operand 678 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:29,358 INFO L93 Difference]: Finished difference Result 1625 states and 2474 transitions. [2025-01-09 13:03:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:03:29,358 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), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-01-09 13:03:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:29,362 INFO L225 Difference]: With dead ends: 1625 [2025-01-09 13:03:29,362 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 13:03:29,364 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-01-09 13:03:29,364 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 152 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:29,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 657 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:03:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 13:03:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 706. [2025-01-09 13:03:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 627 states have (on average 1.467304625199362) internal successors, (920), 629 states have internal predecessors, (920), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 13:03:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1068 transitions. [2025-01-09 13:03:29,398 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1068 transitions. Word has length 207 [2025-01-09 13:03:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:29,399 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1068 transitions. [2025-01-09 13:03:29,399 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), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1068 transitions. [2025-01-09 13:03:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 13:03:29,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:29,402 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:03:29,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1984044928, now seen corresponding path program 1 times [2025-01-09 13:03:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:29,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886417858] [2025-01-09 13:03:29,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:29,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 13:03:29,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 13:03:29,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 13:03:29,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886417858] [2025-01-09 13:03:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886417858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:03:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298530877] [2025-01-09 13:03:29,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:29,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:03:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:03:29,950 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-01-09 13:03:29,951 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-01-09 13:03:30,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 13:03:30,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 13:03:30,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:30,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:30,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 13:03:30,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:03:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-01-09 13:03:30,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:03:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 13:03:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298530877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:03:31,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:03:31,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 6] total 23 [2025-01-09 13:03:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537778419] [2025-01-09 13:03:31,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:03:31,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 13:03:31,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:31,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 13:03:31,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:03:31,227 INFO L87 Difference]: Start difference. First operand 706 states and 1068 transitions. Second operand has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 22 states have internal predecessors, (131), 6 states have call successors, (88), 4 states have call predecessors, (88), 7 states have return successors, (89), 6 states have call predecessors, (89), 6 states have call successors, (89) [2025-01-09 13:03:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:33,698 INFO L93 Difference]: Finished difference Result 1852 states and 2732 transitions. [2025-01-09 13:03:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 13:03:33,699 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 22 states have internal predecessors, (131), 6 states have call successors, (88), 4 states have call predecessors, (88), 7 states have return successors, (89), 6 states have call predecessors, (89), 6 states have call successors, (89) Word has length 208 [2025-01-09 13:03:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:33,707 INFO L225 Difference]: With dead ends: 1852 [2025-01-09 13:03:33,707 INFO L226 Difference]: Without dead ends: 1149 [2025-01-09 13:03:33,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1097, Invalid=5065, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 13:03:33,712 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1712 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:33,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 990 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 13:03:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-01-09 13:03:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1004. [2025-01-09 13:03:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 824 states have (on average 1.4029126213592233) internal successors, (1156), 827 states have internal predecessors, (1156), 159 states have call successors, (159), 20 states have call predecessors, (159), 20 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 13:03:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1474 transitions. [2025-01-09 13:03:33,778 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1474 transitions. Word has length 208 [2025-01-09 13:03:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:33,779 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1474 transitions. [2025-01-09 13:03:33,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 22 states have internal predecessors, (131), 6 states have call successors, (88), 4 states have call predecessors, (88), 7 states have return successors, (89), 6 states have call predecessors, (89), 6 states have call successors, (89) [2025-01-09 13:03:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1474 transitions. [2025-01-09 13:03:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 13:03:33,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:33,781 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:33,789 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-01-09 13:03:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:03:33,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2042319300, now seen corresponding path program 1 times [2025-01-09 13:03:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599272090] [2025-01-09 13:03:33,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:34,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 13:03:34,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 13:03:34,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:34,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599272090] [2025-01-09 13:03:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599272090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:35,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:03:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273983714] [2025-01-09 13:03:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:35,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:03:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:35,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:03:35,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:03:35,672 INFO L87 Difference]: Start difference. First operand 1004 states and 1474 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:37,200 INFO L93 Difference]: Finished difference Result 2055 states and 2981 transitions. [2025-01-09 13:03:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:03:37,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 13:03:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:37,208 INFO L225 Difference]: With dead ends: 2055 [2025-01-09 13:03:37,209 INFO L226 Difference]: Without dead ends: 1612 [2025-01-09 13:03:37,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:03:37,211 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 560 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1361 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 13:03:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-01-09 13:03:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1031. [2025-01-09 13:03:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 850 states have (on average 1.4023529411764706) internal successors, (1192), 853 states have internal predecessors, (1192), 159 states have call successors, (159), 21 states have call predecessors, (159), 21 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 13:03:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1510 transitions. [2025-01-09 13:03:37,281 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1510 transitions. Word has length 208 [2025-01-09 13:03:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:37,282 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1510 transitions. [2025-01-09 13:03:37,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1510 transitions. [2025-01-09 13:03:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 13:03:37,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:37,284 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:37,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:03:37,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:37,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1241530746, now seen corresponding path program 1 times [2025-01-09 13:03:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:37,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870921664] [2025-01-09 13:03:37,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:37,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 13:03:37,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 13:03:37,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:37,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:38,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870921664] [2025-01-09 13:03:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870921664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:03:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477963021] [2025-01-09 13:03:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:38,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:03:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:38,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:03:38,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:03:38,776 INFO L87 Difference]: Start difference. First operand 1031 states and 1510 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:39,907 INFO L93 Difference]: Finished difference Result 2410 states and 3543 transitions. [2025-01-09 13:03:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:03:39,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 13:03:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:39,914 INFO L225 Difference]: With dead ends: 2410 [2025-01-09 13:03:39,914 INFO L226 Difference]: Without dead ends: 1629 [2025-01-09 13:03:39,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:03:39,917 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 208 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:39,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 864 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 13:03:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-01-09 13:03:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1053. [2025-01-09 13:03:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 872 states have (on average 1.4048165137614679) internal successors, (1225), 875 states have internal predecessors, (1225), 159 states have call successors, (159), 21 states have call predecessors, (159), 21 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 13:03:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1543 transitions. [2025-01-09 13:03:39,989 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1543 transitions. Word has length 208 [2025-01-09 13:03:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:39,989 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1543 transitions. [2025-01-09 13:03:39,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1543 transitions. [2025-01-09 13:03:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 13:03:39,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:39,991 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:39,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:03:39,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -600183249, now seen corresponding path program 1 times [2025-01-09 13:03:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48775223] [2025-01-09 13:03:39,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:40,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 13:03:40,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 13:03:40,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:40,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48775223] [2025-01-09 13:03:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48775223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:44,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 13:03:44,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794030764] [2025-01-09 13:03:44,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:44,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 13:03:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:44,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 13:03:44,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:03:44,209 INFO L87 Difference]: Start difference. First operand 1053 states and 1543 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:46,535 INFO L93 Difference]: Finished difference Result 2654 states and 3841 transitions. [2025-01-09 13:03:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:03:46,538 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-01-09 13:03:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:46,545 INFO L225 Difference]: With dead ends: 2654 [2025-01-09 13:03:46,545 INFO L226 Difference]: Without dead ends: 1931 [2025-01-09 13:03:46,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-01-09 13:03:46,548 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 543 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:46,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 946 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 13:03:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-01-09 13:03:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1113. [2025-01-09 13:03:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 932 states have (on average 1.409871244635193) internal successors, (1314), 935 states have internal predecessors, (1314), 159 states have call successors, (159), 21 states have call predecessors, (159), 21 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 13:03:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1632 transitions. [2025-01-09 13:03:46,609 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1632 transitions. Word has length 209 [2025-01-09 13:03:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:46,609 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1632 transitions. [2025-01-09 13:03:46,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1632 transitions. [2025-01-09 13:03:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 13:03:46,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:46,612 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:46,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 13:03:46,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:46,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1880046927, now seen corresponding path program 1 times [2025-01-09 13:03:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:46,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602363734] [2025-01-09 13:03:46,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:46,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 13:03:46,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 13:03:46,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:46,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602363734] [2025-01-09 13:03:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602363734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:03:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154431798] [2025-01-09 13:03:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:48,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:03:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:48,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:03:48,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:03:48,350 INFO L87 Difference]: Start difference. First operand 1113 states and 1632 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:49,776 INFO L93 Difference]: Finished difference Result 2462 states and 3572 transitions. [2025-01-09 13:03:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:03:49,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-01-09 13:03:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:49,782 INFO L225 Difference]: With dead ends: 2462 [2025-01-09 13:03:49,782 INFO L226 Difference]: Without dead ends: 1687 [2025-01-09 13:03:49,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:03:49,784 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 587 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:49,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1123 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 13:03:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2025-01-09 13:03:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1121. [2025-01-09 13:03:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 940 states have (on average 1.4031914893617021) internal successors, (1319), 943 states have internal predecessors, (1319), 159 states have call successors, (159), 21 states have call predecessors, (159), 21 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 13:03:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1637 transitions. [2025-01-09 13:03:49,855 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1637 transitions. Word has length 209 [2025-01-09 13:03:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1637 transitions. [2025-01-09 13:03:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1637 transitions. [2025-01-09 13:03:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 13:03:49,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:49,857 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:49,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:03:49,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:49,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:49,857 INFO L85 PathProgramCache]: Analyzing trace with hash 826572467, now seen corresponding path program 1 times [2025-01-09 13:03:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:49,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312829063] [2025-01-09 13:03:49,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:49,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 13:03:49,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 13:03:49,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:49,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312829063] [2025-01-09 13:03:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312829063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:50,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:50,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:03:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957501923] [2025-01-09 13:03:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:03:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:50,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:03:50,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:03:50,084 INFO L87 Difference]: Start difference. First operand 1121 states and 1637 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 13:03:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:50,533 INFO L93 Difference]: Finished difference Result 3769 states and 5522 transitions. [2025-01-09 13:03:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:03:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 209 [2025-01-09 13:03:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:50,547 INFO L225 Difference]: With dead ends: 3769 [2025-01-09 13:03:50,549 INFO L226 Difference]: Without dead ends: 2889 [2025-01-09 13:03:50,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:03:50,552 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 299 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:50,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 988 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:03:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2025-01-09 13:03:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2017. [2025-01-09 13:03:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1692 states have (on average 1.3930260047281324) internal successors, (2357), 1698 states have internal predecessors, (2357), 287 states have call successors, (287), 37 states have call predecessors, (287), 37 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:03:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2931 transitions. [2025-01-09 13:03:50,682 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2931 transitions. Word has length 209 [2025-01-09 13:03:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 2931 transitions. [2025-01-09 13:03:50,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 13:03:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2931 transitions. [2025-01-09 13:03:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 13:03:50,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:50,685 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:50,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 13:03:50,685 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:50,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash -97932005, now seen corresponding path program 1 times [2025-01-09 13:03:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:50,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378887629] [2025-01-09 13:03:50,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:50,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 13:03:50,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 13:03:50,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:50,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378887629] [2025-01-09 13:03:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378887629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:51,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:03:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350649088] [2025-01-09 13:03:51,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:51,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:03:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:51,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:03:51,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:03:51,958 INFO L87 Difference]: Start difference. First operand 2017 states and 2931 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:52,985 INFO L93 Difference]: Finished difference Result 4588 states and 6647 transitions. [2025-01-09 13:03:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:03:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-01-09 13:03:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:52,994 INFO L225 Difference]: With dead ends: 4588 [2025-01-09 13:03:52,994 INFO L226 Difference]: Without dead ends: 2934 [2025-01-09 13:03:52,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:03:52,997 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 261 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:52,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 879 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:03:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2025-01-09 13:03:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2186. [2025-01-09 13:03:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1861 states have (on average 1.3960236432025792) internal successors, (2598), 1867 states have internal predecessors, (2598), 287 states have call successors, (287), 37 states have call predecessors, (287), 37 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:03:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3172 transitions. [2025-01-09 13:03:53,109 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3172 transitions. Word has length 209 [2025-01-09 13:03:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:53,110 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3172 transitions. [2025-01-09 13:03:53,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3172 transitions. [2025-01-09 13:03:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 13:03:53,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:53,111 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:53,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 13:03:53,112 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:53,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -398147721, now seen corresponding path program 1 times [2025-01-09 13:03:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861954344] [2025-01-09 13:03:53,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:53,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 13:03:53,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 13:03:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 13:03:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861954344] [2025-01-09 13:03:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861954344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:03:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407333146] [2025-01-09 13:03:53,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:03:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:03:53,314 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-01-09 13:03:53,317 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-01-09 13:03:53,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 13:03:53,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 13:03:53,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:53,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:53,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 13:03:53,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:03:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 670 proven. 144 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2025-01-09 13:03:53,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:03:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 147 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-01-09 13:03:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407333146] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:03:54,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:03:54,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 25 [2025-01-09 13:03:54,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740687749] [2025-01-09 13:03:54,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:03:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 13:03:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:54,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 13:03:54,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:03:54,250 INFO L87 Difference]: Start difference. First operand 2186 states and 3172 transitions. Second operand has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 5 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2025-01-09 13:03:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:55,801 INFO L93 Difference]: Finished difference Result 4307 states and 6178 transitions. [2025-01-09 13:03:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 13:03:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 5 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) Word has length 210 [2025-01-09 13:03:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:55,809 INFO L225 Difference]: With dead ends: 4307 [2025-01-09 13:03:55,809 INFO L226 Difference]: Without dead ends: 2268 [2025-01-09 13:03:55,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=625, Invalid=2131, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 13:03:55,812 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1101 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:55,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1790 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 13:03:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2025-01-09 13:03:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1846. [2025-01-09 13:03:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1512 states have (on average 1.3485449735449735) internal successors, (2039), 1518 states have internal predecessors, (2039), 287 states have call successors, (287), 46 states have call predecessors, (287), 46 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:03:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2613 transitions. [2025-01-09 13:03:55,931 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2613 transitions. Word has length 210 [2025-01-09 13:03:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:55,931 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2613 transitions. [2025-01-09 13:03:55,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 5 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2025-01-09 13:03:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2613 transitions. [2025-01-09 13:03:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 13:03:55,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:55,932 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:55,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:03:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:03:56,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1167237990, now seen corresponding path program 1 times [2025-01-09 13:03:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898389803] [2025-01-09 13:03:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:56,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 13:03:56,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 13:03:56,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:03:57,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:03:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898389803] [2025-01-09 13:03:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898389803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:03:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483273606] [2025-01-09 13:03:57,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:57,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:03:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:03:57,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:03:57,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:03:57,981 INFO L87 Difference]: Start difference. First operand 1846 states and 2613 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:58,812 INFO L93 Difference]: Finished difference Result 3519 states and 4979 transitions. [2025-01-09 13:03:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:03:58,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 13:03:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:58,821 INFO L225 Difference]: With dead ends: 3519 [2025-01-09 13:03:58,821 INFO L226 Difference]: Without dead ends: 2765 [2025-01-09 13:03:58,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:03:58,823 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 415 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:58,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 504 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:03:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2025-01-09 13:03:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1871. [2025-01-09 13:03:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1537 states have (on average 1.3513337670787249) internal successors, (2077), 1543 states have internal predecessors, (2077), 287 states have call successors, (287), 46 states have call predecessors, (287), 46 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:03:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2651 transitions. [2025-01-09 13:03:58,950 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2651 transitions. Word has length 210 [2025-01-09 13:03:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:58,951 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2651 transitions. [2025-01-09 13:03:58,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:03:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2651 transitions. [2025-01-09 13:03:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 13:03:58,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:58,952 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:03:58,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 13:03:58,953 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:58,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash 156120740, now seen corresponding path program 1 times [2025-01-09 13:03:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:03:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62684378] [2025-01-09 13:03:58,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:03:58,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 13:03:59,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 13:03:59,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:59,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:00,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62684378] [2025-01-09 13:04:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62684378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:04:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130167319] [2025-01-09 13:04:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:00,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:04:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:00,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:04:00,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:04:00,967 INFO L87 Difference]: Start difference. First operand 1871 states and 2651 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:03,330 INFO L93 Difference]: Finished difference Result 3646 states and 5153 transitions. [2025-01-09 13:04:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 13:04:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 13:04:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:03,339 INFO L225 Difference]: With dead ends: 3646 [2025-01-09 13:04:03,339 INFO L226 Difference]: Without dead ends: 2468 [2025-01-09 13:04:03,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-09 13:04:03,341 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 707 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:03,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1213 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 13:04:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2025-01-09 13:04:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 1909. [2025-01-09 13:04:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1575 states have (on average 1.3523809523809525) internal successors, (2130), 1581 states have internal predecessors, (2130), 287 states have call successors, (287), 46 states have call predecessors, (287), 46 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:04:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2704 transitions. [2025-01-09 13:04:03,455 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2704 transitions. Word has length 210 [2025-01-09 13:04:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:03,455 INFO L471 AbstractCegarLoop]: Abstraction has 1909 states and 2704 transitions. [2025-01-09 13:04:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2704 transitions. [2025-01-09 13:04:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 13:04:03,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:03,457 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 13:04:03,457 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -521705752, now seen corresponding path program 1 times [2025-01-09 13:04:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218670067] [2025-01-09 13:04:03,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:03,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 13:04:03,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 13:04:03,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:03,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:06,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218670067] [2025-01-09 13:04:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218670067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 13:04:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578879530] [2025-01-09 13:04:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:06,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:04:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:06,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:04:06,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:04:06,376 INFO L87 Difference]: Start difference. First operand 1909 states and 2704 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:08,345 INFO L93 Difference]: Finished difference Result 3472 states and 4892 transitions. [2025-01-09 13:04:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:04:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 13:04:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:08,353 INFO L225 Difference]: With dead ends: 3472 [2025-01-09 13:04:08,353 INFO L226 Difference]: Without dead ends: 2681 [2025-01-09 13:04:08,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:04:08,355 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 405 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:08,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 842 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 13:04:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2025-01-09 13:04:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 1905. [2025-01-09 13:04:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1571 states have (on average 1.351368555060471) internal successors, (2123), 1577 states have internal predecessors, (2123), 287 states have call successors, (287), 46 states have call predecessors, (287), 46 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:04:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2697 transitions. [2025-01-09 13:04:08,478 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2697 transitions. Word has length 210 [2025-01-09 13:04:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:08,478 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2697 transitions. [2025-01-09 13:04:08,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2697 transitions. [2025-01-09 13:04:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 13:04:08,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:08,479 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:08,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 13:04:08,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:08,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1532823002, now seen corresponding path program 1 times [2025-01-09 13:04:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:08,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292246803] [2025-01-09 13:04:08,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:08,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 13:04:08,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 13:04:08,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:10,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292246803] [2025-01-09 13:04:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292246803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:10,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 13:04:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908313706] [2025-01-09 13:04:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:10,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:04:10,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:10,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:04:10,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:04:10,760 INFO L87 Difference]: Start difference. First operand 1905 states and 2697 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:13,334 INFO L93 Difference]: Finished difference Result 3896 states and 5490 transitions. [2025-01-09 13:04:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 13:04:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 13:04:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:13,340 INFO L225 Difference]: With dead ends: 3896 [2025-01-09 13:04:13,340 INFO L226 Difference]: Without dead ends: 2454 [2025-01-09 13:04:13,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2025-01-09 13:04:13,343 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 310 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:13,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 999 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 13:04:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2025-01-09 13:04:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 1913. [2025-01-09 13:04:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1579 states have (on average 1.3533882203926535) internal successors, (2137), 1585 states have internal predecessors, (2137), 287 states have call successors, (287), 46 states have call predecessors, (287), 46 states have return successors, (287), 281 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 13:04:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2711 transitions. [2025-01-09 13:04:13,465 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2711 transitions. Word has length 210 [2025-01-09 13:04:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:13,465 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2711 transitions. [2025-01-09 13:04:13,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2711 transitions. [2025-01-09 13:04:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 13:04:13,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:13,466 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:13,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 13:04:13,466 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:13,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1468716904, now seen corresponding path program 1 times [2025-01-09 13:04:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517751346] [2025-01-09 13:04:13,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:13,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 13:04:13,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 13:04:13,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:13,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517751346] [2025-01-09 13:04:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517751346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:04:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358438318] [2025-01-09 13:04:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:13,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:04:13,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:13,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:04:13,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:04:13,774 INFO L87 Difference]: Start difference. First operand 1913 states and 2711 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 13:04:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:14,453 INFO L93 Difference]: Finished difference Result 5227 states and 7330 transitions. [2025-01-09 13:04:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:04:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 212 [2025-01-09 13:04:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:14,461 INFO L225 Difference]: With dead ends: 5227 [2025-01-09 13:04:14,461 INFO L226 Difference]: Without dead ends: 3492 [2025-01-09 13:04:14,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:04:14,464 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 540 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:14,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 696 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:04:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2025-01-09 13:04:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 2900. [2025-01-09 13:04:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2418 states have (on average 1.360628618693135) internal successors, (3290), 2427 states have internal predecessors, (3290), 415 states have call successors, (415), 66 states have call predecessors, (415), 66 states have return successors, (415), 406 states have call predecessors, (415), 415 states have call successors, (415) [2025-01-09 13:04:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4120 transitions. [2025-01-09 13:04:14,647 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4120 transitions. Word has length 212 [2025-01-09 13:04:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:14,647 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4120 transitions. [2025-01-09 13:04:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 13:04:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4120 transitions. [2025-01-09 13:04:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 13:04:14,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:14,648 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 13:04:14,648 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash -788658534, now seen corresponding path program 1 times [2025-01-09 13:04:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268836296] [2025-01-09 13:04:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:14,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 13:04:14,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 13:04:14,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:14,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:16,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268836296] [2025-01-09 13:04:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268836296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:16,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:04:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442799280] [2025-01-09 13:04:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:16,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:04:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:16,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:04:16,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:04:16,132 INFO L87 Difference]: Start difference. First operand 2900 states and 4120 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:18,496 INFO L93 Difference]: Finished difference Result 5951 states and 8408 transitions. [2025-01-09 13:04:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:04:18,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 212 [2025-01-09 13:04:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:18,505 INFO L225 Difference]: With dead ends: 5951 [2025-01-09 13:04:18,505 INFO L226 Difference]: Without dead ends: 3738 [2025-01-09 13:04:18,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:04:18,508 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 464 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:18,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 996 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 13:04:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2025-01-09 13:04:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 2807. [2025-01-09 13:04:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2325 states have (on average 1.3612903225806452) internal successors, (3165), 2334 states have internal predecessors, (3165), 415 states have call successors, (415), 66 states have call predecessors, (415), 66 states have return successors, (415), 406 states have call predecessors, (415), 415 states have call successors, (415) [2025-01-09 13:04:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3995 transitions. [2025-01-09 13:04:18,690 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3995 transitions. Word has length 212 [2025-01-09 13:04:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:18,691 INFO L471 AbstractCegarLoop]: Abstraction has 2807 states and 3995 transitions. [2025-01-09 13:04:18,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3995 transitions. [2025-01-09 13:04:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 13:04:18,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:18,692 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:18,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 13:04:18,692 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:18,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1046015078, now seen corresponding path program 1 times [2025-01-09 13:04:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521306317] [2025-01-09 13:04:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 13:04:18,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 13:04:18,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:18,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521306317] [2025-01-09 13:04:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521306317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:04:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764341655] [2025-01-09 13:04:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:18,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:04:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:18,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:04:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:04:18,750 INFO L87 Difference]: Start difference. First operand 2807 states and 3995 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:19,074 INFO L93 Difference]: Finished difference Result 7340 states and 10419 transitions. [2025-01-09 13:04:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:04:19,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 212 [2025-01-09 13:04:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:19,087 INFO L225 Difference]: With dead ends: 7340 [2025-01-09 13:04:19,087 INFO L226 Difference]: Without dead ends: 4769 [2025-01-09 13:04:19,091 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-01-09 13:04:19,092 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 90 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:19,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 375 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:04:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-01-09 13:04:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4578. [2025-01-09 13:04:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 3652 states have (on average 1.3285870755750273) internal successors, (4852), 3670 states have internal predecessors, (4852), 799 states have call successors, (799), 126 states have call predecessors, (799), 126 states have return successors, (799), 781 states have call predecessors, (799), 799 states have call successors, (799) [2025-01-09 13:04:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 6450 transitions. [2025-01-09 13:04:19,563 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 6450 transitions. Word has length 212 [2025-01-09 13:04:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:19,563 INFO L471 AbstractCegarLoop]: Abstraction has 4578 states and 6450 transitions. [2025-01-09 13:04:19,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 6450 transitions. [2025-01-09 13:04:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 13:04:19,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:19,564 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:19,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 13:04:19,565 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash -365956708, now seen corresponding path program 1 times [2025-01-09 13:04:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:19,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410693669] [2025-01-09 13:04:19,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:19,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 13:04:19,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 13:04:19,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:19,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 13:04:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410693669] [2025-01-09 13:04:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410693669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:04:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:04:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 13:04:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76196435] [2025-01-09 13:04:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:04:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:04:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:21,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:04:21,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:04:21,177 INFO L87 Difference]: Start difference. First operand 4578 states and 6450 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:04:23,323 INFO L93 Difference]: Finished difference Result 9170 states and 12886 transitions. [2025-01-09 13:04:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:04:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 212 [2025-01-09 13:04:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:04:23,335 INFO L225 Difference]: With dead ends: 9170 [2025-01-09 13:04:23,335 INFO L226 Difference]: Without dead ends: 5825 [2025-01-09 13:04:23,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:04:23,340 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 623 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:04:23,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 980 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 13:04:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2025-01-09 13:04:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 4492. [2025-01-09 13:04:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3566 states have (on average 1.3255748738081885) internal successors, (4727), 3584 states have internal predecessors, (4727), 799 states have call successors, (799), 126 states have call predecessors, (799), 126 states have return successors, (799), 781 states have call predecessors, (799), 799 states have call successors, (799) [2025-01-09 13:04:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6325 transitions. [2025-01-09 13:04:23,700 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6325 transitions. Word has length 212 [2025-01-09 13:04:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:04:23,701 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 6325 transitions. [2025-01-09 13:04:23,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 13:04:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6325 transitions. [2025-01-09 13:04:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 13:04:23,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:04:23,702 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:04:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 13:04:23,703 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:04:23,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:04:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash -421273971, now seen corresponding path program 1 times [2025-01-09 13:04:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:04:23,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721146643] [2025-01-09 13:04:23,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:04:23,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 13:04:23,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 13:04:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 57 proven. 195 refuted. 0 times theorem prover too weak. 1608 trivial. 0 not checked. [2025-01-09 13:04:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:04:24,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721146643] [2025-01-09 13:04:24,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721146643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:04:24,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106711002] [2025-01-09 13:04:24,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:04:24,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:04:24,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:04:24,778 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-01-09 13:04:24,778 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-01-09 13:04:24,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 13:04:24,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 13:04:24,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:04:24,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:04:24,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 13:04:24,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:04:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 670 proven. 321 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-01-09 13:04:26,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:04:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 129 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-01-09 13:04:32,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106711002] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:04:32,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:04:32,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 15] total 44 [2025-01-09 13:04:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559069917] [2025-01-09 13:04:32,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:04:32,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 13:04:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:04:32,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 13:04:32,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 13:04:32,484 INFO L87 Difference]: Start difference. First operand 4492 states and 6325 transitions. Second operand has 44 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 40 states have internal predecessors, (166), 11 states have call successors, (82), 6 states have call predecessors, (82), 10 states have return successors, (84), 11 states have call predecessors, (84), 11 states have call successors, (84)