./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 029e66cc29f9dcf52d753d6fa453421ef1b83ddb99d478b0b8b7f28a0a169bb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:44:08,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:44:08,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:44:08,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:44:08,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:44:08,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:44:08,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:44:08,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:44:08,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:44:08,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:44:08,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:44:08,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:44:08,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:44:08,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:44:08,192 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:44:08,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:44:08,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:44:08,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:44:08,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:44:08,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:44:08,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:44:08,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:44:08,196 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 -> 029e66cc29f9dcf52d753d6fa453421ef1b83ddb99d478b0b8b7f28a0a169bb8 [2025-02-05 17:44:08,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:44:08,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:44:08,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:44:08,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:44:08,444 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:44:08,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c [2025-02-05 17:44:09,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/978faff03/6af42b02d428436aaefb34742b2b99c3/FLAG7bc68ae86 [2025-02-05 17:44:10,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:44:10,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c [2025-02-05 17:44:10,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/978faff03/6af42b02d428436aaefb34742b2b99c3/FLAG7bc68ae86 [2025-02-05 17:44:10,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/978faff03/6af42b02d428436aaefb34742b2b99c3 [2025-02-05 17:44:10,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:44:10,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:44:10,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:44:10,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:44:10,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:44:10,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:44:10" (1/1) ... [2025-02-05 17:44:10,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bc82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:10, skipping insertion in model container [2025-02-05 17:44:10,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:44:10" (1/1) ... [2025-02-05 17:44:10,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:44:10,444 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/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c[15519,15532] [2025-02-05 17:44:10,491 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/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c[23267,23280] [2025-02-05 17:44:10,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:44:10,894 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:44:10,930 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/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c[15519,15532] [2025-02-05 17:44:10,940 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/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c[23267,23280] [2025-02-05 17:44:11,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:44:11,203 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:44:11,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11 WrapperNode [2025-02-05 17:44:11,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:44:11,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:44:11,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:44:11,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:44:11,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,556 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5154 [2025-02-05 17:44:11,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:44:11,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:44:11,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:44:11,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:44:11,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,741 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:44:11,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:44:11,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:44:11,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:44:11,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:44:11,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (1/1) ... [2025-02-05 17:44:11,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:44:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:11,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:44:11,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:44:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:44:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:44:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:44:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:44:12,063 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:44:12,065 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:44:15,518 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret43#1; [2025-02-05 17:44:15,518 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret44#1; [2025-02-05 17:44:15,519 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret42#1; [2025-02-05 17:44:15,646 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-02-05 17:44:15,646 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:44:15,675 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:44:15,678 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:44:15,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:44:15 BoogieIcfgContainer [2025-02-05 17:44:15,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:44:15,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:44:15,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:44:15,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:44:15,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:44:10" (1/3) ... [2025-02-05 17:44:15,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68588bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:44:15, skipping insertion in model container [2025-02-05 17:44:15,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:11" (2/3) ... [2025-02-05 17:44:15,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68588bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:44:15, skipping insertion in model container [2025-02-05 17:44:15,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:44:15" (3/3) ... [2025-02-05 17:44:15,687 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c [2025-02-05 17:44:15,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:44:15,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label09.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:44:15,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:44:15,762 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;@36c66383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:44:15,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:44:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 17:44:15,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:15,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:15,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:15,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1801860080, now seen corresponding path program 1 times [2025-02-05 17:44:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904566079] [2025-02-05 17:44:15,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:15,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 17:44:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 17:44:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:15,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904566079] [2025-02-05 17:44:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904566079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:44:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888604880] [2025-02-05 17:44:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:44:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:15,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:44:15,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:44:16,003 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:16,103 INFO L93 Difference]: Finished difference Result 1780 states and 3376 transitions. [2025-02-05 17:44:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:44:16,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 17:44:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:16,127 INFO L225 Difference]: With dead ends: 1780 [2025-02-05 17:44:16,127 INFO L226 Difference]: Without dead ends: 848 [2025-02-05 17:44:16,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:44:16,135 INFO L435 NwaCegarLoop]: 1668 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, 1668 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-02-05 17:44:16,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-02-05 17:44:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-02-05 17:44:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.8936170212765957) internal successors, (1602), 847 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1602 transitions. [2025-02-05 17:44:16,209 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1602 transitions. Word has length 26 [2025-02-05 17:44:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:16,209 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1602 transitions. [2025-02-05 17:44:16,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1602 transitions. [2025-02-05 17:44:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 17:44:16,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:16,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:16,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:44:16,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:16,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1393035855, now seen corresponding path program 1 times [2025-02-05 17:44:16,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:16,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882579680] [2025-02-05 17:44:16,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:16,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:16,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 17:44:16,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 17:44:16,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882579680] [2025-02-05 17:44:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882579680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:16,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:16,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:44:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996381358] [2025-02-05 17:44:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:16,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:44:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:44:16,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:44:16,504 INFO L87 Difference]: Start difference. First operand 848 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:16,607 INFO L93 Difference]: Finished difference Result 900 states and 1683 transitions. [2025-02-05 17:44:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:44:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 17:44:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:16,612 INFO L225 Difference]: With dead ends: 900 [2025-02-05 17:44:16,612 INFO L226 Difference]: Without dead ends: 848 [2025-02-05 17:44:16,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:44:16,613 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:16,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-02-05 17:44:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-02-05 17:44:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.846335697399527) internal successors, (1562), 847 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1562 transitions. [2025-02-05 17:44:16,650 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1562 transitions. Word has length 26 [2025-02-05 17:44:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:16,651 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1562 transitions. [2025-02-05 17:44:16,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1562 transitions. [2025-02-05 17:44:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:44:16,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:16,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:16,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:44:16,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:16,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash 720868248, now seen corresponding path program 1 times [2025-02-05 17:44:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776067297] [2025-02-05 17:44:16,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:16,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:44:16,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:44:16,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:16,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776067297] [2025-02-05 17:44:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776067297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304332811] [2025-02-05 17:44:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:16,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:16,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:16,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:16,990 INFO L87 Difference]: Start difference. First operand 848 states and 1562 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:17,559 INFO L93 Difference]: Finished difference Result 1424 states and 2486 transitions. [2025-02-05 17:44:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:44:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:44:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:17,569 INFO L225 Difference]: With dead ends: 1424 [2025-02-05 17:44:17,570 INFO L226 Difference]: Without dead ends: 1376 [2025-02-05 17:44:17,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:44:17,572 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9635 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9635 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:17,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9635 Valid, 3990 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:44:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-02-05 17:44:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 894. [2025-02-05 17:44:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 892 states have (on average 1.8340807174887892) internal successors, (1636), 893 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1636 transitions. [2025-02-05 17:44:17,621 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1636 transitions. Word has length 65 [2025-02-05 17:44:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:17,621 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1636 transitions. [2025-02-05 17:44:17,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1636 transitions. [2025-02-05 17:44:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:44:17,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:17,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:17,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:44:17,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1909962381, now seen corresponding path program 1 times [2025-02-05 17:44:17,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:17,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940000986] [2025-02-05 17:44:17,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:17,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:17,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:44:17,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:44:17,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:17,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:17,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940000986] [2025-02-05 17:44:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940000986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:17,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:17,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044754760] [2025-02-05 17:44:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:17,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:17,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:17,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:17,751 INFO L87 Difference]: Start difference. First operand 894 states and 1636 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:17,783 INFO L93 Difference]: Finished difference Result 1071 states and 1919 transitions. [2025-02-05 17:44:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:17,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:44:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:17,788 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 17:44:17,788 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 17:44:17,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:17,790 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:17,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 17:44:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 975. [2025-02-05 17:44:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 973 states have (on average 1.8129496402877698) internal successors, (1764), 974 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1764 transitions. [2025-02-05 17:44:17,815 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1764 transitions. Word has length 67 [2025-02-05 17:44:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:17,817 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1764 transitions. [2025-02-05 17:44:17,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1764 transitions. [2025-02-05 17:44:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:44:17,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:17,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:17,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:44:17,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1877639146, now seen corresponding path program 1 times [2025-02-05 17:44:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576544866] [2025-02-05 17:44:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:17,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:44:17,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:44:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576544866] [2025-02-05 17:44:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576544866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:18,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112673598] [2025-02-05 17:44:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:18,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:18,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:18,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:18,208 INFO L87 Difference]: Start difference. First operand 975 states and 1764 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:18,407 INFO L93 Difference]: Finished difference Result 1152 states and 2044 transitions. [2025-02-05 17:44:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:18,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:44:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:18,412 INFO L225 Difference]: With dead ends: 1152 [2025-02-05 17:44:18,413 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 17:44:18,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 17:44:18,415 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 8992 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8992 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:18,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8992 Valid, 1922 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 17:44:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 975. [2025-02-05 17:44:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 973 states have (on average 1.8108941418293936) internal successors, (1762), 974 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1762 transitions. [2025-02-05 17:44:18,440 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1762 transitions. Word has length 67 [2025-02-05 17:44:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:18,441 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1762 transitions. [2025-02-05 17:44:18,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1762 transitions. [2025-02-05 17:44:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:44:18,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:18,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:44:18,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 71177356, now seen corresponding path program 1 times [2025-02-05 17:44:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885451800] [2025-02-05 17:44:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:18,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:44:18,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:44:18,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:18,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885451800] [2025-02-05 17:44:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885451800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:18,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:18,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433831926] [2025-02-05 17:44:18,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:44:18,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:18,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:44:18,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:44:18,584 INFO L87 Difference]: Start difference. First operand 975 states and 1762 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:23,783 INFO L93 Difference]: Finished difference Result 3230 states and 6071 transitions. [2025-02-05 17:44:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:44:23,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:44:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:23,792 INFO L225 Difference]: With dead ends: 3230 [2025-02-05 17:44:23,792 INFO L226 Difference]: Without dead ends: 2477 [2025-02-05 17:44:23,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:44:23,793 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2425 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2425 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:23,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2425 Valid, 816 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 17:44:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-02-05 17:44:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2025-02-05 17:44:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.5660606060606062) internal successors, (3876), 2476 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3876 transitions. [2025-02-05 17:44:23,832 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3876 transitions. Word has length 67 [2025-02-05 17:44:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:23,832 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3876 transitions. [2025-02-05 17:44:23,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3876 transitions. [2025-02-05 17:44:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:44:23,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:23,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:23,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:44:23,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1953266352, now seen corresponding path program 1 times [2025-02-05 17:44:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449358078] [2025-02-05 17:44:23,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:23,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:44:23,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:44:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449358078] [2025-02-05 17:44:24,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449358078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:24,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:24,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851009853] [2025-02-05 17:44:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:24,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:24,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:24,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:24,090 INFO L87 Difference]: Start difference. First operand 2477 states and 3876 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:24,139 INFO L93 Difference]: Finished difference Result 2485 states and 3885 transitions. [2025-02-05 17:44:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:24,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 17:44:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:24,147 INFO L225 Difference]: With dead ends: 2485 [2025-02-05 17:44:24,147 INFO L226 Difference]: Without dead ends: 2483 [2025-02-05 17:44:24,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:24,149 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 0 mSDsluCounter, 9323 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10879 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:24,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10879 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2025-02-05 17:44:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2025-02-05 17:44:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5642885933091495) internal successors, (3881), 2482 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3881 transitions. [2025-02-05 17:44:24,188 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3881 transitions. Word has length 68 [2025-02-05 17:44:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:24,188 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3881 transitions. [2025-02-05 17:44:24,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3881 transitions. [2025-02-05 17:44:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:44:24,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:24,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:44:24,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash -38470604, now seen corresponding path program 1 times [2025-02-05 17:44:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597173604] [2025-02-05 17:44:24,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:44:24,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:44:24,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:24,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597173604] [2025-02-05 17:44:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597173604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996297001] [2025-02-05 17:44:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:24,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:24,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,237 INFO L87 Difference]: Start difference. First operand 2483 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:24,259 INFO L93 Difference]: Finished difference Result 2677 states and 4182 transitions. [2025-02-05 17:44:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:44:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:24,267 INFO L225 Difference]: With dead ends: 2677 [2025-02-05 17:44:24,267 INFO L226 Difference]: Without dead ends: 2577 [2025-02-05 17:44:24,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,269 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:24,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-02-05 17:44:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2575. [2025-02-05 17:44:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 2573 states have (on average 1.5631558492032647) internal successors, (4022), 2574 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 4022 transitions. [2025-02-05 17:44:24,308 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 4022 transitions. Word has length 69 [2025-02-05 17:44:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:24,309 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 4022 transitions. [2025-02-05 17:44:24,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 4022 transitions. [2025-02-05 17:44:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:44:24,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:24,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:24,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:44:24,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -192839436, now seen corresponding path program 1 times [2025-02-05 17:44:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:24,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633086850] [2025-02-05 17:44:24,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:24,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:44:24,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:44:24,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:24,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633086850] [2025-02-05 17:44:24,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633086850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:24,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:24,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:24,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740254506] [2025-02-05 17:44:24,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:24,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:24,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:24,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:24,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,367 INFO L87 Difference]: Start difference. First operand 2575 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:24,391 INFO L93 Difference]: Finished difference Result 3093 states and 4822 transitions. [2025-02-05 17:44:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:24,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:44:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:24,399 INFO L225 Difference]: With dead ends: 3093 [2025-02-05 17:44:24,399 INFO L226 Difference]: Without dead ends: 2822 [2025-02-05 17:44:24,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,401 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:24,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2025-02-05 17:44:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2820. [2025-02-05 17:44:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2818 states have (on average 1.5592618878637332) internal successors, (4394), 2819 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4394 transitions. [2025-02-05 17:44:24,448 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4394 transitions. Word has length 69 [2025-02-05 17:44:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:24,448 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 4394 transitions. [2025-02-05 17:44:24,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4394 transitions. [2025-02-05 17:44:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:44:24,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:24,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:24,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:44:24,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:24,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1171769932, now seen corresponding path program 1 times [2025-02-05 17:44:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:24,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787722232] [2025-02-05 17:44:24,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:24,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:44:24,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:44:24,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:24,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787722232] [2025-02-05 17:44:24,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787722232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:24,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:24,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:24,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748957369] [2025-02-05 17:44:24,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:24,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:24,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:24,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,495 INFO L87 Difference]: Start difference. First operand 2820 states and 4394 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:24,522 INFO L93 Difference]: Finished difference Result 3804 states and 5896 transitions. [2025-02-05 17:44:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:24,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:44:24,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:24,532 INFO L225 Difference]: With dead ends: 3804 [2025-02-05 17:44:24,532 INFO L226 Difference]: Without dead ends: 3288 [2025-02-05 17:44:24,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,534 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:24,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-02-05 17:44:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3286. [2025-02-05 17:44:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 3284 states have (on average 1.5499390986601704) internal successors, (5090), 3285 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 5090 transitions. [2025-02-05 17:44:24,584 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 5090 transitions. Word has length 69 [2025-02-05 17:44:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:24,585 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 5090 transitions. [2025-02-05 17:44:24,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 5090 transitions. [2025-02-05 17:44:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:44:24,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:24,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:24,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:44:24,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1619715468, now seen corresponding path program 1 times [2025-02-05 17:44:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:24,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449957462] [2025-02-05 17:44:24,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:24,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:44:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:44:24,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:24,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449957462] [2025-02-05 17:44:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449957462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:24,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:24,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298259391] [2025-02-05 17:44:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:24,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:24,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:24,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,628 INFO L87 Difference]: Start difference. First operand 3286 states and 5090 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:24,658 INFO L93 Difference]: Finished difference Result 5154 states and 7900 transitions. [2025-02-05 17:44:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:24,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:44:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:24,671 INFO L225 Difference]: With dead ends: 5154 [2025-02-05 17:44:24,674 INFO L226 Difference]: Without dead ends: 4172 [2025-02-05 17:44:24,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,677 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:24,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-02-05 17:44:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4170. [2025-02-05 17:44:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4168 states have (on average 1.5321497120921306) internal successors, (6386), 4169 states have internal predecessors, (6386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6386 transitions. [2025-02-05 17:44:24,751 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6386 transitions. Word has length 69 [2025-02-05 17:44:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:24,751 INFO L471 AbstractCegarLoop]: Abstraction has 4170 states and 6386 transitions. [2025-02-05 17:44:24,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6386 transitions. [2025-02-05 17:44:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:44:24,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:24,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:24,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:44:24,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1204539596, now seen corresponding path program 1 times [2025-02-05 17:44:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:24,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712428456] [2025-02-05 17:44:24,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:24,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:44:24,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:44:24,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:24,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712428456] [2025-02-05 17:44:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712428456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600367123] [2025-02-05 17:44:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:24,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,793 INFO L87 Difference]: Start difference. First operand 4170 states and 6386 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:24,841 INFO L93 Difference]: Finished difference Result 7710 states and 11620 transitions. [2025-02-05 17:44:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:44:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:24,857 INFO L225 Difference]: With dead ends: 7710 [2025-02-05 17:44:24,860 INFO L226 Difference]: Without dead ends: 5844 [2025-02-05 17:44:24,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:24,864 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:24,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2025-02-05 17:44:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5842. [2025-02-05 17:44:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5842 states, 5840 states have (on average 1.5044520547945206) internal successors, (8786), 5841 states have internal predecessors, (8786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 8786 transitions. [2025-02-05 17:44:24,976 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 8786 transitions. Word has length 69 [2025-02-05 17:44:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:24,976 INFO L471 AbstractCegarLoop]: Abstraction has 5842 states and 8786 transitions. [2025-02-05 17:44:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 8786 transitions. [2025-02-05 17:44:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:44:24,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:24,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:44:24,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1691257868, now seen corresponding path program 1 times [2025-02-05 17:44:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355918398] [2025-02-05 17:44:24,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:25,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:44:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:44:25,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:25,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355918398] [2025-02-05 17:44:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355918398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903245094] [2025-02-05 17:44:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:25,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:25,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:25,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:25,101 INFO L87 Difference]: Start difference. First operand 5842 states and 8786 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:25,177 INFO L93 Difference]: Finished difference Result 12534 states and 18484 transitions. [2025-02-05 17:44:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:25,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:44:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:25,193 INFO L225 Difference]: With dead ends: 12534 [2025-02-05 17:44:25,193 INFO L226 Difference]: Without dead ends: 8996 [2025-02-05 17:44:25,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:25,198 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:25,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1716 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8996 states. [2025-02-05 17:44:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8996 to 8994. [2025-02-05 17:44:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8994 states, 8992 states have (on average 1.468193950177936) internal successors, (13202), 8993 states have internal predecessors, (13202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8994 states to 8994 states and 13202 transitions. [2025-02-05 17:44:25,320 INFO L78 Accepts]: Start accepts. Automaton has 8994 states and 13202 transitions. Word has length 69 [2025-02-05 17:44:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:25,321 INFO L471 AbstractCegarLoop]: Abstraction has 8994 states and 13202 transitions. [2025-02-05 17:44:25,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8994 states and 13202 transitions. [2025-02-05 17:44:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:25,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:25,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:44:25,324 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 704030, now seen corresponding path program 1 times [2025-02-05 17:44:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999426937] [2025-02-05 17:44:25,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:25,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:25,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:25,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:25,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:44:25,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:25,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999426937] [2025-02-05 17:44:25,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999426937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:25,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:25,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994273673] [2025-02-05 17:44:25,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:25,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:25,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:25,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:25,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:25,475 INFO L87 Difference]: Start difference. First operand 8994 states and 13202 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:26,125 INFO L93 Difference]: Finished difference Result 48592 states and 69977 transitions. [2025-02-05 17:44:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:26,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:26,197 INFO L225 Difference]: With dead ends: 48592 [2025-02-05 17:44:26,197 INFO L226 Difference]: Without dead ends: 43854 [2025-02-05 17:44:26,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:44:26,211 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8022 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8022 SdHoareTripleChecker+Valid, 4153 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:26,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8022 Valid, 4153 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43854 states. [2025-02-05 17:44:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43854 to 14722. [2025-02-05 17:44:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14722 states, 14720 states have (on average 1.4490489130434783) internal successors, (21330), 14721 states have internal predecessors, (21330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 21330 transitions. [2025-02-05 17:44:26,594 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 21330 transitions. Word has length 90 [2025-02-05 17:44:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:26,594 INFO L471 AbstractCegarLoop]: Abstraction has 14722 states and 21330 transitions. [2025-02-05 17:44:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 21330 transitions. [2025-02-05 17:44:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:26,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:26,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:26,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:44:26,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:26,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -153664802, now seen corresponding path program 1 times [2025-02-05 17:44:26,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:26,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489642419] [2025-02-05 17:44:26,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:26,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:26,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:26,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:26,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:44:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489642419] [2025-02-05 17:44:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489642419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:26,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:26,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638161144] [2025-02-05 17:44:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:26,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:26,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:26,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:26,796 INFO L87 Difference]: Start difference. First operand 14722 states and 21330 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:27,474 INFO L93 Difference]: Finished difference Result 55280 states and 79513 transitions. [2025-02-05 17:44:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:27,548 INFO L225 Difference]: With dead ends: 55280 [2025-02-05 17:44:27,548 INFO L226 Difference]: Without dead ends: 48590 [2025-02-05 17:44:27,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:44:27,561 INFO L435 NwaCegarLoop]: 1637 mSDtfsCounter, 8022 mSDsluCounter, 2504 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8022 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:27,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8022 Valid, 4141 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48590 states. [2025-02-05 17:44:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48590 to 23778. [2025-02-05 17:44:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23778 states, 23776 states have (on average 1.4368270524899058) internal successors, (34162), 23777 states have internal predecessors, (34162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23778 states to 23778 states and 34162 transitions. [2025-02-05 17:44:28,225 INFO L78 Accepts]: Start accepts. Automaton has 23778 states and 34162 transitions. Word has length 90 [2025-02-05 17:44:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:28,226 INFO L471 AbstractCegarLoop]: Abstraction has 23778 states and 34162 transitions. [2025-02-05 17:44:28,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 23778 states and 34162 transitions. [2025-02-05 17:44:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:28,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:28,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:28,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:44:28,234 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:28,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1132595298, now seen corresponding path program 1 times [2025-02-05 17:44:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584203017] [2025-02-05 17:44:28,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:28,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:28,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:28,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:28,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:28,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:44:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584203017] [2025-02-05 17:44:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584203017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429339403] [2025-02-05 17:44:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:28,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:28,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:28,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:28,469 INFO L87 Difference]: Start difference. First operand 23778 states and 34162 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:29,486 INFO L93 Difference]: Finished difference Result 61968 states and 89017 transitions. [2025-02-05 17:44:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:29,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:29,592 INFO L225 Difference]: With dead ends: 61968 [2025-02-05 17:44:29,592 INFO L226 Difference]: Without dead ends: 55278 [2025-02-05 17:44:29,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:44:29,609 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8046 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8046 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:29,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8046 Valid, 4067 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55278 states. [2025-02-05 17:44:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55278 to 30466. [2025-02-05 17:44:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30466 states, 30464 states have (on average 1.4333639705882353) internal successors, (43666), 30465 states have internal predecessors, (43666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30466 states to 30466 states and 43666 transitions. [2025-02-05 17:44:30,730 INFO L78 Accepts]: Start accepts. Automaton has 30466 states and 43666 transitions. Word has length 90 [2025-02-05 17:44:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:30,730 INFO L471 AbstractCegarLoop]: Abstraction has 30466 states and 43666 transitions. [2025-02-05 17:44:30,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30466 states and 43666 transitions. [2025-02-05 17:44:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:30,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:30,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:30,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:44:30,735 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:30,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1580540834, now seen corresponding path program 1 times [2025-02-05 17:44:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184836312] [2025-02-05 17:44:30,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:44:30,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:30,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184836312] [2025-02-05 17:44:30,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184836312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:30,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:30,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417904110] [2025-02-05 17:44:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:30,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:30,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:30,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:30,858 INFO L87 Difference]: Start difference. First operand 30466 states and 43666 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:31,970 INFO L93 Difference]: Finished difference Result 68656 states and 98521 transitions. [2025-02-05 17:44:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:32,049 INFO L225 Difference]: With dead ends: 68656 [2025-02-05 17:44:32,049 INFO L226 Difference]: Without dead ends: 61966 [2025-02-05 17:44:32,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:44:32,063 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8084 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8084 SdHoareTripleChecker+Valid, 4034 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:32,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8084 Valid, 4034 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61966 states. [2025-02-05 17:44:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61966 to 37154. [2025-02-05 17:44:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37154 states, 37152 states have (on average 1.4311477174849268) internal successors, (53170), 37153 states have internal predecessors, (53170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37154 states to 37154 states and 53170 transitions. [2025-02-05 17:44:33,253 INFO L78 Accepts]: Start accepts. Automaton has 37154 states and 53170 transitions. Word has length 90 [2025-02-05 17:44:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:33,254 INFO L471 AbstractCegarLoop]: Abstraction has 37154 states and 53170 transitions. [2025-02-05 17:44:33,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 37154 states and 53170 transitions. [2025-02-05 17:44:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:33,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:33,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:44:33,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1165364962, now seen corresponding path program 1 times [2025-02-05 17:44:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850086357] [2025-02-05 17:44:33,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:33,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:33,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:33,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:33,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:44:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850086357] [2025-02-05 17:44:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850086357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523528720] [2025-02-05 17:44:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:33,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:33,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:33,414 INFO L87 Difference]: Start difference. First operand 37154 states and 53170 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:34,722 INFO L93 Difference]: Finished difference Result 75344 states and 108025 transitions. [2025-02-05 17:44:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:34,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:34,804 INFO L225 Difference]: With dead ends: 75344 [2025-02-05 17:44:34,805 INFO L226 Difference]: Without dead ends: 68654 [2025-02-05 17:44:34,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:44:34,818 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8129 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8129 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:34,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8129 Valid, 4063 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68654 states. [2025-02-05 17:44:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68654 to 43842. [2025-02-05 17:44:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43842 states, 43840 states have (on average 1.4296076642335767) internal successors, (62674), 43841 states have internal predecessors, (62674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43842 states to 43842 states and 62674 transitions. [2025-02-05 17:44:36,011 INFO L78 Accepts]: Start accepts. Automaton has 43842 states and 62674 transitions. Word has length 90 [2025-02-05 17:44:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:36,011 INFO L471 AbstractCegarLoop]: Abstraction has 43842 states and 62674 transitions. [2025-02-05 17:44:36,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 43842 states and 62674 transitions. [2025-02-05 17:44:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:36,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:36,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:36,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:44:36,024 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:36,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:36,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1652083234, now seen corresponding path program 1 times [2025-02-05 17:44:36,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:36,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383694394] [2025-02-05 17:44:36,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:36,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:36,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:36,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:36,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:36,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 17:44:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383694394] [2025-02-05 17:44:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383694394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:44:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731890589] [2025-02-05 17:44:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:36,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:44:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:36,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:44:36,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:44:36,184 INFO L87 Difference]: Start difference. First operand 43842 states and 62674 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:37,976 INFO L93 Difference]: Finished difference Result 82032 states and 117529 transitions. [2025-02-05 17:44:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:44:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:38,072 INFO L225 Difference]: With dead ends: 82032 [2025-02-05 17:44:38,072 INFO L226 Difference]: Without dead ends: 75342 [2025-02-05 17:44:38,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:44:38,097 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8048 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8048 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:38,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8048 Valid, 4128 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:44:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75342 states. [2025-02-05 17:44:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75342 to 50530. [2025-02-05 17:44:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50530 states, 50528 states have (on average 1.428475300823306) internal successors, (72178), 50529 states have internal predecessors, (72178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50530 states to 50530 states and 72178 transitions. [2025-02-05 17:44:40,351 INFO L78 Accepts]: Start accepts. Automaton has 50530 states and 72178 transitions. Word has length 90 [2025-02-05 17:44:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 50530 states and 72178 transitions. [2025-02-05 17:44:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 50530 states and 72178 transitions. [2025-02-05 17:44:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:44:40,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:40,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:44:40,360 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 112504176, now seen corresponding path program 1 times [2025-02-05 17:44:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452995958] [2025-02-05 17:44:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:40,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:44:40,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:44:40,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:40,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452995958] [2025-02-05 17:44:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452995958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524998071] [2025-02-05 17:44:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:40,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:40,448 INFO L87 Difference]: Start difference. First operand 50530 states and 72178 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:41,672 INFO L93 Difference]: Finished difference Result 98758 states and 140756 transitions. [2025-02-05 17:44:41,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:41,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 17:44:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:41,749 INFO L225 Difference]: With dead ends: 98758 [2025-02-05 17:44:41,749 INFO L226 Difference]: Without dead ends: 50532 [2025-02-05 17:44:41,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:41,785 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:41,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50532 states. [2025-02-05 17:44:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50532 to 50530. [2025-02-05 17:44:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50530 states, 50528 states have (on average 1.414859088030399) internal successors, (71490), 50529 states have internal predecessors, (71490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50530 states to 50530 states and 71490 transitions. [2025-02-05 17:44:43,153 INFO L78 Accepts]: Start accepts. Automaton has 50530 states and 71490 transitions. Word has length 91 [2025-02-05 17:44:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:43,154 INFO L471 AbstractCegarLoop]: Abstraction has 50530 states and 71490 transitions. [2025-02-05 17:44:43,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 50530 states and 71490 transitions. [2025-02-05 17:44:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:44:43,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:43,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:43,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:44:43,159 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:43,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash -490310180, now seen corresponding path program 1 times [2025-02-05 17:44:43,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691540576] [2025-02-05 17:44:43,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:43,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:44:43,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:44:43,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:43,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:43,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691540576] [2025-02-05 17:44:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691540576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315175201] [2025-02-05 17:44:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:43,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:43,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:43,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:43,336 INFO L87 Difference]: Start difference. First operand 50530 states and 71490 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:43,757 INFO L93 Difference]: Finished difference Result 68315 states and 96714 transitions. [2025-02-05 17:44:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 17:44:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:43,783 INFO L225 Difference]: With dead ends: 68315 [2025-02-05 17:44:43,784 INFO L226 Difference]: Without dead ends: 20089 [2025-02-05 17:44:43,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:43,814 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:43,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20089 states. [2025-02-05 17:44:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20089 to 20081. [2025-02-05 17:44:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20081 states, 20079 states have (on average 1.423228248418746) internal successors, (28577), 20080 states have internal predecessors, (28577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 28577 transitions. [2025-02-05 17:44:44,183 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 28577 transitions. Word has length 92 [2025-02-05 17:44:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:44,183 INFO L471 AbstractCegarLoop]: Abstraction has 20081 states and 28577 transitions. [2025-02-05 17:44:44,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 28577 transitions. [2025-02-05 17:44:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 17:44:44,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:44,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:44,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:44:44,185 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:44,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -818182665, now seen corresponding path program 1 times [2025-02-05 17:44:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715466150] [2025-02-05 17:44:44,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:44,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:44,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 17:44:44,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 17:44:44,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715466150] [2025-02-05 17:44:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715466150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568134895] [2025-02-05 17:44:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:44,241 INFO L87 Difference]: Start difference. First operand 20081 states and 28577 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:44,392 INFO L93 Difference]: Finished difference Result 28965 states and 41059 transitions. [2025-02-05 17:44:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 17:44:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:44,405 INFO L225 Difference]: With dead ends: 28965 [2025-02-05 17:44:44,406 INFO L226 Difference]: Without dead ends: 11203 [2025-02-05 17:44:44,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:44,418 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:44,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11203 states. [2025-02-05 17:44:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11203 to 11201. [2025-02-05 17:44:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11201 states, 11199 states have (on average 1.426645236181802) internal successors, (15977), 11200 states have internal predecessors, (15977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 15977 transitions. [2025-02-05 17:44:44,596 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 15977 transitions. Word has length 93 [2025-02-05 17:44:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:44,596 INFO L471 AbstractCegarLoop]: Abstraction has 11201 states and 15977 transitions. [2025-02-05 17:44:44,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 15977 transitions. [2025-02-05 17:44:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 17:44:44,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:44,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:44:44,598 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash -85389410, now seen corresponding path program 1 times [2025-02-05 17:44:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704583815] [2025-02-05 17:44:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:44,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 17:44:44,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 17:44:44,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:44,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:44,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704583815] [2025-02-05 17:44:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704583815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15698553] [2025-02-05 17:44:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:44,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:44,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:44,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:44,653 INFO L87 Difference]: Start difference. First operand 11201 states and 15977 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:44,733 INFO L93 Difference]: Finished difference Result 15645 states and 22159 transitions. [2025-02-05 17:44:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 17:44:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:44,742 INFO L225 Difference]: With dead ends: 15645 [2025-02-05 17:44:44,742 INFO L226 Difference]: Without dead ends: 6763 [2025-02-05 17:44:44,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:44,748 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:44,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-02-05 17:44:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-02-05 17:44:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6759 states have (on average 1.4405977215564432) internal successors, (9737), 6760 states have internal predecessors, (9737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9737 transitions. [2025-02-05 17:44:44,847 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9737 transitions. Word has length 95 [2025-02-05 17:44:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:44,847 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9737 transitions. [2025-02-05 17:44:44,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9737 transitions. [2025-02-05 17:44:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 17:44:44,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:44,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:44:44,848 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1915372955, now seen corresponding path program 1 times [2025-02-05 17:44:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:44,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529916398] [2025-02-05 17:44:44,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:44,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 17:44:44,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 17:44:44,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:44,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:44,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:44,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529916398] [2025-02-05 17:44:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529916398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394120640] [2025-02-05 17:44:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:44,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:44,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:44,906 INFO L87 Difference]: Start difference. First operand 6761 states and 9737 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:45,025 INFO L93 Difference]: Finished difference Result 8985 states and 12799 transitions. [2025-02-05 17:44:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 17:44:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:45,030 INFO L225 Difference]: With dead ends: 8985 [2025-02-05 17:44:45,031 INFO L226 Difference]: Without dead ends: 4543 [2025-02-05 17:44:45,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:45,034 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:45,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-02-05 17:44:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4541. [2025-02-05 17:44:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4541 states, 4539 states have (on average 1.4644194756554307) internal successors, (6647), 4540 states have internal predecessors, (6647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 6647 transitions. [2025-02-05 17:44:45,100 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 6647 transitions. Word has length 97 [2025-02-05 17:44:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:45,100 INFO L471 AbstractCegarLoop]: Abstraction has 4541 states and 6647 transitions. [2025-02-05 17:44:45,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 6647 transitions. [2025-02-05 17:44:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 17:44:45,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:45,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:45,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 17:44:45,101 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:45,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1704200628, now seen corresponding path program 1 times [2025-02-05 17:44:45,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:45,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981168746] [2025-02-05 17:44:45,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:45,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:45,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 17:44:45,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 17:44:45,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:45,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:45,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981168746] [2025-02-05 17:44:45,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981168746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:45,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:45,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:44:45,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764998699] [2025-02-05 17:44:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:45,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:45,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:45,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:45,161 INFO L87 Difference]: Start difference. First operand 4541 states and 6647 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:45,197 INFO L93 Difference]: Finished difference Result 5655 states and 8164 transitions. [2025-02-05 17:44:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:44:45,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 17:44:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:45,202 INFO L225 Difference]: With dead ends: 5655 [2025-02-05 17:44:45,203 INFO L226 Difference]: Without dead ends: 3433 [2025-02-05 17:44:45,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:45,205 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:45,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:44:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-02-05 17:44:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3431. [2025-02-05 17:44:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 3429 states have (on average 1.4922717993584136) internal successors, (5117), 3430 states have internal predecessors, (5117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5117 transitions. [2025-02-05 17:44:45,248 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5117 transitions. Word has length 99 [2025-02-05 17:44:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 3431 states and 5117 transitions. [2025-02-05 17:44:45,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5117 transitions. [2025-02-05 17:44:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:44:45,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:45,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:45,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 17:44:45,250 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -932695213, now seen corresponding path program 1 times [2025-02-05 17:44:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018002653] [2025-02-05 17:44:45,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:45,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:44:45,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:44:45,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:45,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018002653] [2025-02-05 17:44:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018002653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:46,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173064210] [2025-02-05 17:44:46,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:46,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:46,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:46,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:44:46,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:44:46,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:44:46,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:46,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:44:46,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:46,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173064210] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:47,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-02-05 17:44:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995166086] [2025-02-05 17:44:47,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:47,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:44:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:47,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:44:47,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:44:47,785 INFO L87 Difference]: Start difference. First operand 3431 states and 5117 transitions. Second operand has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 27 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:50,910 INFO L93 Difference]: Finished difference Result 8141 states and 11474 transitions. [2025-02-05 17:44:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 17:44:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 27 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-02-05 17:44:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:50,920 INFO L225 Difference]: With dead ends: 8141 [2025-02-05 17:44:50,920 INFO L226 Difference]: Without dead ends: 7029 [2025-02-05 17:44:50,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=866, Invalid=3690, Unknown=0, NotChecked=0, Total=4556 [2025-02-05 17:44:50,924 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 20303 mSDsluCounter, 5516 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20303 SdHoareTripleChecker+Valid, 7047 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:50,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20303 Valid, 7047 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:44:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7029 states. [2025-02-05 17:44:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7029 to 6897. [2025-02-05 17:44:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6897 states, 6895 states have (on average 1.4063814358230602) internal successors, (9697), 6896 states have internal predecessors, (9697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6897 states to 6897 states and 9697 transitions. [2025-02-05 17:44:51,054 INFO L78 Accepts]: Start accepts. Automaton has 6897 states and 9697 transitions. Word has length 101 [2025-02-05 17:44:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:51,054 INFO L471 AbstractCegarLoop]: Abstraction has 6897 states and 9697 transitions. [2025-02-05 17:44:51,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 27 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6897 states and 9697 transitions. [2025-02-05 17:44:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 17:44:51,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:51,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:51,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:44:51,257 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,SelfDestructingSolverStorable25 [2025-02-05 17:44:51,257 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1581390114, now seen corresponding path program 1 times [2025-02-05 17:44:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:51,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202883968] [2025-02-05 17:44:51,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:51,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 17:44:51,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 17:44:51,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:51,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202883968] [2025-02-05 17:44:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202883968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051211284] [2025-02-05 17:44:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:51,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:51,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:44:51,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 17:44:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 17:44:51,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:51,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:51,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:44:51,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:52,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051211284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:53,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-02-05 17:44:53,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966174895] [2025-02-05 17:44:53,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 17:44:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:53,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 17:44:53,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-02-05 17:44:53,035 INFO L87 Difference]: Start difference. First operand 6897 states and 9697 transitions. Second operand has 26 states, 26 states have (on average 9.923076923076923) internal successors, (258), 25 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:53,813 INFO L93 Difference]: Finished difference Result 16415 states and 22400 transitions. [2025-02-05 17:44:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:44:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.923076923076923) internal successors, (258), 25 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-02-05 17:44:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:53,839 INFO L225 Difference]: With dead ends: 16415 [2025-02-05 17:44:53,839 INFO L226 Difference]: Without dead ends: 11837 [2025-02-05 17:44:53,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 17:44:53,848 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 16881 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16881 SdHoareTripleChecker+Valid, 5043 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:53,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16881 Valid, 5043 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:44:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2025-02-05 17:44:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 11713. [2025-02-05 17:44:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11713 states, 11711 states have (on average 1.3625651097258988) internal successors, (15957), 11712 states have internal predecessors, (15957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11713 states to 11713 states and 15957 transitions. [2025-02-05 17:44:54,292 INFO L78 Accepts]: Start accepts. Automaton has 11713 states and 15957 transitions. Word has length 102 [2025-02-05 17:44:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:54,292 INFO L471 AbstractCegarLoop]: Abstraction has 11713 states and 15957 transitions. [2025-02-05 17:44:54,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.923076923076923) internal successors, (258), 25 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 11713 states and 15957 transitions. [2025-02-05 17:44:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 17:44:54,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:54,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:54,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:44:54,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 17:44:54,499 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:54,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1880934434, now seen corresponding path program 1 times [2025-02-05 17:44:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:54,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506285660] [2025-02-05 17:44:54,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:54,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 17:44:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 17:44:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:54,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506285660] [2025-02-05 17:44:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506285660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959075366] [2025-02-05 17:44:54,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:54,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:54,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:54,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:44:54,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 17:44:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 17:44:54,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 17:44:54,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:55,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:56,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959075366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:56,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:56,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 17:44:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964095698] [2025-02-05 17:44:56,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:56,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 17:44:56,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:56,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 17:44:56,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:44:56,012 INFO L87 Difference]: Start difference. First operand 11713 states and 15957 transitions. Second operand has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 22 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:56,655 INFO L93 Difference]: Finished difference Result 18039 states and 24360 transitions. [2025-02-05 17:44:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:44:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 22 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 17:44:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:56,695 INFO L225 Difference]: With dead ends: 18039 [2025-02-05 17:44:56,696 INFO L226 Difference]: Without dead ends: 12077 [2025-02-05 17:44:56,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 17:44:56,704 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 14193 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14193 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:56,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14193 Valid, 6292 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:44:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12077 states. [2025-02-05 17:44:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12077 to 11921. [2025-02-05 17:44:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11921 states, 11919 states have (on average 1.355566742176357) internal successors, (16157), 11920 states have internal predecessors, (16157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11921 states to 11921 states and 16157 transitions. [2025-02-05 17:44:57,099 INFO L78 Accepts]: Start accepts. Automaton has 11921 states and 16157 transitions. Word has length 103 [2025-02-05 17:44:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 11921 states and 16157 transitions. [2025-02-05 17:44:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 22 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11921 states and 16157 transitions. [2025-02-05 17:44:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 17:44:57,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:57,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:57,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:44:57,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:57,304 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 870608551, now seen corresponding path program 1 times [2025-02-05 17:44:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361193978] [2025-02-05 17:44:57,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:57,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 17:44:57,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 17:44:57,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:57,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361193978] [2025-02-05 17:44:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361193978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207136155] [2025-02-05 17:44:58,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:58,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:58,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:58,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:58,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:44:58,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 17:44:58,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 17:44:58,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:58,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:58,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 17:44:58,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:59,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:45:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207136155] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:45:02,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:45:02,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 36 [2025-02-05 17:45:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586232167] [2025-02-05 17:45:02,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:45:02,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 17:45:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:02,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 17:45:02,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 17:45:02,080 INFO L87 Difference]: Start difference. First operand 11921 states and 16157 transitions. Second operand has 36 states, 36 states have (on average 7.861111111111111) internal successors, (283), 36 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:06,995 INFO L93 Difference]: Finished difference Result 45559 states and 60324 transitions. [2025-02-05 17:45:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-05 17:45:06,996 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.861111111111111) internal successors, (283), 36 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 17:45:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:07,042 INFO L225 Difference]: With dead ends: 45559 [2025-02-05 17:45:07,042 INFO L226 Difference]: Without dead ends: 35957 [2025-02-05 17:45:07,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2403 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1871, Invalid=6139, Unknown=0, NotChecked=0, Total=8010 [2025-02-05 17:45:07,071 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 21225 mSDsluCounter, 13180 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21225 SdHoareTripleChecker+Valid, 14745 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:07,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21225 Valid, 14745 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 17:45:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35957 states. [2025-02-05 17:45:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35957 to 28137. [2025-02-05 17:45:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28137 states, 28135 states have (on average 1.314839168295717) internal successors, (36993), 28136 states have internal predecessors, (36993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28137 states to 28137 states and 36993 transitions. [2025-02-05 17:45:07,800 INFO L78 Accepts]: Start accepts. Automaton has 28137 states and 36993 transitions. Word has length 103 [2025-02-05 17:45:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:07,801 INFO L471 AbstractCegarLoop]: Abstraction has 28137 states and 36993 transitions. [2025-02-05 17:45:07,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.861111111111111) internal successors, (283), 36 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28137 states and 36993 transitions. [2025-02-05 17:45:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:45:07,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:07,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:07,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:45:08,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 17:45:08,008 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:08,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash -720181950, now seen corresponding path program 1 times [2025-02-05 17:45:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927892048] [2025-02-05 17:45:08,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:08,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:08,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:45:08,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:45:08,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:08,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927892048] [2025-02-05 17:45:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927892048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:45:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15707696] [2025-02-05 17:45:08,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:08,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:45:08,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:45:08,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:45:08,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:45:08,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:45:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:08,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:45:08,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:45:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:08,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:45:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15707696] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:45:09,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:45:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 17:45:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326418609] [2025-02-05 17:45:09,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:45:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 17:45:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:09,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 17:45:09,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-02-05 17:45:09,839 INFO L87 Difference]: Start difference. First operand 28137 states and 36993 transitions. Second operand has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:10,723 INFO L93 Difference]: Finished difference Result 59296 states and 77564 transitions. [2025-02-05 17:45:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:45:10,723 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 17:45:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:10,769 INFO L225 Difference]: With dead ends: 59296 [2025-02-05 17:45:10,770 INFO L226 Difference]: Without dead ends: 33478 [2025-02-05 17:45:10,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:45:10,794 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 13636 mSDsluCounter, 4792 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13636 SdHoareTripleChecker+Valid, 6317 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:10,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13636 Valid, 6317 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:45:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33478 states. [2025-02-05 17:45:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33478 to 33474. [2025-02-05 17:45:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33474 states, 33472 states have (on average 1.3144717973231357) internal successors, (43998), 33473 states have internal predecessors, (43998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33474 states to 33474 states and 43998 transitions. [2025-02-05 17:45:11,880 INFO L78 Accepts]: Start accepts. Automaton has 33474 states and 43998 transitions. Word has length 104 [2025-02-05 17:45:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:11,880 INFO L471 AbstractCegarLoop]: Abstraction has 33474 states and 43998 transitions. [2025-02-05 17:45:11,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 33474 states and 43998 transitions. [2025-02-05 17:45:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 17:45:11,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:11,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:11,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 17:45:12,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:12,084 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:12,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash -924843706, now seen corresponding path program 1 times [2025-02-05 17:45:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898439534] [2025-02-05 17:45:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:12,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 17:45:12,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 17:45:12,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:12,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:12,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898439534] [2025-02-05 17:45:12,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898439534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:45:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044504045] [2025-02-05 17:45:12,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:12,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:45:12,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:45:12,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:45:12,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 17:45:12,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 17:45:12,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:12,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:12,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:45:12,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:45:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:13,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:45:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044504045] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:45:14,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:45:14,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 17:45:14,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442360891] [2025-02-05 17:45:14,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:45:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:45:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:14,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:45:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:45:14,168 INFO L87 Difference]: Start difference. First operand 33474 states and 43998 transitions. Second operand has 29 states, 29 states have (on average 10.172413793103448) internal successors, (295), 29 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:16,031 INFO L93 Difference]: Finished difference Result 97872 states and 127901 transitions. [2025-02-05 17:45:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:45:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.172413793103448) internal successors, (295), 29 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 17:45:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:16,114 INFO L225 Difference]: With dead ends: 97872 [2025-02-05 17:45:16,114 INFO L226 Difference]: Without dead ends: 66730 [2025-02-05 17:45:16,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 17:45:16,151 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 13512 mSDsluCounter, 6710 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13512 SdHoareTripleChecker+Valid, 8240 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:16,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13512 Valid, 8240 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:45:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66730 states. [2025-02-05 17:45:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66730 to 66022. [2025-02-05 17:45:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66022 states, 66020 states have (on average 1.293850348379279) internal successors, (85420), 66021 states have internal predecessors, (85420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66022 states to 66022 states and 85420 transitions. [2025-02-05 17:45:18,041 INFO L78 Accepts]: Start accepts. Automaton has 66022 states and 85420 transitions. Word has length 105 [2025-02-05 17:45:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:18,042 INFO L471 AbstractCegarLoop]: Abstraction has 66022 states and 85420 transitions. [2025-02-05 17:45:18,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.172413793103448) internal successors, (295), 29 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 66022 states and 85420 transitions. [2025-02-05 17:45:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 17:45:18,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:18,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:18,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 17:45:18,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-05 17:45:18,250 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:18,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:18,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1296074072, now seen corresponding path program 1 times [2025-02-05 17:45:18,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:18,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842440028] [2025-02-05 17:45:18,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:18,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 17:45:18,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 17:45:18,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:18,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842440028] [2025-02-05 17:45:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842440028] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:45:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425187503] [2025-02-05 17:45:18,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:18,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:18,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:45:18,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:45:18,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:45:18,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 17:45:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 17:45:18,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:18,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-05 17:45:18,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:45:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:31,207 INFO L312 TraceCheckSpWp]: Computing backward predicates...