./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:42:56,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:42:56,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:42:56,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:42:56,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:42:56,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:42:56,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:42:56,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:42:56,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:42:56,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:42:56,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:42:56,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:42:56,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:42:56,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:42:56,495 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:42:56,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:42:56,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:42:56,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:42:56,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:42:56,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:42:56,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:42:56,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:42:56,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:42:56,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:42:56,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:42:56,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:42:56,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:42:56,498 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 -> 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd [2025-01-09 14:42:56,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:42:56,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:42:56,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:42:56,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:42:56,769 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:42:56,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i [2025-01-09 14:42:57,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18394c59e/0aa71d8d308440ad86be387e09e87d17/FLAGb6608ef0c [2025-01-09 14:42:58,255 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:42:58,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i [2025-01-09 14:42:58,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18394c59e/0aa71d8d308440ad86be387e09e87d17/FLAGb6608ef0c [2025-01-09 14:42:58,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18394c59e/0aa71d8d308440ad86be387e09e87d17 [2025-01-09 14:42:58,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:42:58,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:42:58,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:42:58,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:42:58,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:42:58,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58, skipping insertion in model container [2025-01-09 14:42:58,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:42:58,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i[915,928] [2025-01-09 14:42:58,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:42:58,633 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:42:58,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i[915,928] [2025-01-09 14:42:58,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:42:58,749 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:42:58,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58 WrapperNode [2025-01-09 14:42:58,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:42:58,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:42:58,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:42:58,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:42:58,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,854 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 717 [2025-01-09 14:42:58,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:42:58,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:42:58,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:42:58,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:42:58,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,957 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:42:58,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,979 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:58,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:59,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:59,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:59,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:42:59,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:42:59,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:42:59,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:42:59,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (1/1) ... [2025-01-09 14:42:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:42:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:42:59,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:42:59,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:42:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:42:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:42:59,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:42:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:42:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:42:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:42:59,210 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:42:59,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:43:00,226 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-09 14:43:00,227 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:43:00,245 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:43:00,245 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:43:00,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:00 BoogieIcfgContainer [2025-01-09 14:43:00,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:43:00,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:43:00,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:43:00,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:43:00,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:42:58" (1/3) ... [2025-01-09 14:43:00,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a66c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:00, skipping insertion in model container [2025-01-09 14:43:00,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:58" (2/3) ... [2025-01-09 14:43:00,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a66c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:00, skipping insertion in model container [2025-01-09 14:43:00,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:00" (3/3) ... [2025-01-09 14:43:00,252 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-0.i [2025-01-09 14:43:00,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:43:00,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-0.i that has 2 procedures, 289 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:43:00,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:43:00,328 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;@38c744af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:43:00,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:43:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 226 states have internal predecessors, (350), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:43:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:00,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:00,352 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:00,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:00,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash -346228058, now seen corresponding path program 1 times [2025-01-09 14:43:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078554976] [2025-01-09 14:43:00,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:00,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:00,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-01-09 14:43:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078554976] [2025-01-09 14:43:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078554976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139324613] [2025-01-09 14:43:00,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:00,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:00,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:43:00,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:43:00,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:01,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:01,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:43:01,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-01-09 14:43:01,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:43:01,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139324613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:01,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:43:01,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:43:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95981291] [2025-01-09 14:43:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:43:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:43:01,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:43:01,238 INFO L87 Difference]: Start difference. First operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 226 states have internal predecessors, (350), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:43:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:01,283 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2025-01-09 14:43:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:43:01,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 429 [2025-01-09 14:43:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:01,291 INFO L225 Difference]: With dead ends: 572 [2025-01-09 14:43:01,291 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 14:43:01,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:43:01,296 INFO L435 NwaCegarLoop]: 466 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, 466 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:01,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 14:43:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-01-09 14:43:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 223 states have (on average 1.5426008968609866) internal successors, (344), 223 states have internal predecessors, (344), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:43:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 466 transitions. [2025-01-09 14:43:01,341 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 466 transitions. Word has length 429 [2025-01-09 14:43:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:01,342 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 466 transitions. [2025-01-09 14:43:01,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:43:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 466 transitions. [2025-01-09 14:43:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:01,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:01,352 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:01,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:43:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:43:01,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash -67710508, now seen corresponding path program 1 times [2025-01-09 14:43:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336870748] [2025-01-09 14:43:01,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:01,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:01,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:01,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:01,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336870748] [2025-01-09 14:43:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336870748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:02,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763869022] [2025-01-09 14:43:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:02,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:02,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:02,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:02,075 INFO L87 Difference]: Start difference. First operand 286 states and 466 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:02,158 INFO L93 Difference]: Finished difference Result 738 states and 1209 transitions. [2025-01-09 14:43:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:43:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:02,166 INFO L225 Difference]: With dead ends: 738 [2025-01-09 14:43:02,166 INFO L226 Difference]: Without dead ends: 455 [2025-01-09 14:43:02,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:02,168 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 292 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:02,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 888 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-09 14:43:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 427. [2025-01-09 14:43:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 364 states have (on average 1.6016483516483517) internal successors, (583), 364 states have internal predecessors, (583), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:43:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 705 transitions. [2025-01-09 14:43:02,204 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 705 transitions. Word has length 429 [2025-01-09 14:43:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:02,206 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 705 transitions. [2025-01-09 14:43:02,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 705 transitions. [2025-01-09 14:43:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:02,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:02,212 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:02,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:43:02,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:02,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 172529238, now seen corresponding path program 1 times [2025-01-09 14:43:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:02,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332860683] [2025-01-09 14:43:02,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:02,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:02,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:02,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:02,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:02,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332860683] [2025-01-09 14:43:02,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332860683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:02,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622041197] [2025-01-09 14:43:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:02,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:02,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:02,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:02,540 INFO L87 Difference]: Start difference. First operand 427 states and 705 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:02,613 INFO L93 Difference]: Finished difference Result 1120 states and 1854 transitions. [2025-01-09 14:43:02,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:02,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:43:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:02,618 INFO L225 Difference]: With dead ends: 1120 [2025-01-09 14:43:02,618 INFO L226 Difference]: Without dead ends: 696 [2025-01-09 14:43:02,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:02,619 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 262 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:02,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 936 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-01-09 14:43:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 693. [2025-01-09 14:43:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 619 states have (on average 1.6219709208400646) internal successors, (1004), 620 states have internal predecessors, (1004), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 14:43:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1146 transitions. [2025-01-09 14:43:02,644 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1146 transitions. Word has length 429 [2025-01-09 14:43:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:02,645 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1146 transitions. [2025-01-09 14:43:02,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1146 transitions. [2025-01-09 14:43:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:02,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:02,657 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:02,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:43:02,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:02,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash -29294696, now seen corresponding path program 1 times [2025-01-09 14:43:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857987249] [2025-01-09 14:43:02,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:02,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:02,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:02,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:02,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857987249] [2025-01-09 14:43:02,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857987249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:02,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:02,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:02,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728120971] [2025-01-09 14:43:02,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:02,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:02,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:02,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:02,954 INFO L87 Difference]: Start difference. First operand 693 states and 1146 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:03,038 INFO L93 Difference]: Finished difference Result 1954 states and 3229 transitions. [2025-01-09 14:43:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:43:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:03,046 INFO L225 Difference]: With dead ends: 1954 [2025-01-09 14:43:03,046 INFO L226 Difference]: Without dead ends: 1264 [2025-01-09 14:43:03,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:03,048 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 288 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:03,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1134 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-01-09 14:43:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1260. [2025-01-09 14:43:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1172 states have (on average 1.6237201365187712) internal successors, (1903), 1175 states have internal predecessors, (1903), 83 states have call successors, (83), 4 states have call predecessors, (83), 4 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:43:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 2069 transitions. [2025-01-09 14:43:03,085 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 2069 transitions. Word has length 429 [2025-01-09 14:43:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 2069 transitions. [2025-01-09 14:43:03,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 2069 transitions. [2025-01-09 14:43:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:03,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:03,091 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:03,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:43:03,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:03,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash 114008476, now seen corresponding path program 1 times [2025-01-09 14:43:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:03,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937259183] [2025-01-09 14:43:03,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:03,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:03,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:03,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937259183] [2025-01-09 14:43:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937259183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:03,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:03,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789060237] [2025-01-09 14:43:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:03,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:03,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:03,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:03,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:03,319 INFO L87 Difference]: Start difference. First operand 1260 states and 2069 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:03,397 INFO L93 Difference]: Finished difference Result 3594 states and 5905 transitions. [2025-01-09 14:43:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:03,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:43:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:03,407 INFO L225 Difference]: With dead ends: 3594 [2025-01-09 14:43:03,407 INFO L226 Difference]: Without dead ends: 2337 [2025-01-09 14:43:03,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:03,410 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 263 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:03,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 902 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-01-09 14:43:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2334. [2025-01-09 14:43:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 2206 states have (on average 1.627833182230281) internal successors, (3591), 2213 states have internal predecessors, (3591), 119 states have call successors, (119), 8 states have call predecessors, (119), 8 states have return successors, (119), 112 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 14:43:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3829 transitions. [2025-01-09 14:43:03,465 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3829 transitions. Word has length 429 [2025-01-09 14:43:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:03,466 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 3829 transitions. [2025-01-09 14:43:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3829 transitions. [2025-01-09 14:43:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:03,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:03,473 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:03,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:43:03,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1007494814, now seen corresponding path program 1 times [2025-01-09 14:43:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926507187] [2025-01-09 14:43:03,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:03,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:03,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:03,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926507187] [2025-01-09 14:43:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926507187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:04,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:04,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:43:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681603921] [2025-01-09 14:43:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:04,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:43:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:04,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:43:04,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:43:04,711 INFO L87 Difference]: Start difference. First operand 2334 states and 3829 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:43:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:05,550 INFO L93 Difference]: Finished difference Result 7914 states and 12901 transitions. [2025-01-09 14:43:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:43:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 429 [2025-01-09 14:43:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:05,569 INFO L225 Difference]: With dead ends: 7914 [2025-01-09 14:43:05,569 INFO L226 Difference]: Without dead ends: 5583 [2025-01-09 14:43:05,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:43:05,577 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 958 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:05,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2192 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:43:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2025-01-09 14:43:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 4635. [2025-01-09 14:43:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4635 states, 4379 states have (on average 1.6206896551724137) internal successors, (7097), 4393 states have internal predecessors, (7097), 238 states have call successors, (238), 17 states have call predecessors, (238), 17 states have return successors, (238), 224 states have call predecessors, (238), 238 states have call successors, (238) [2025-01-09 14:43:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 7573 transitions. [2025-01-09 14:43:05,736 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 7573 transitions. Word has length 429 [2025-01-09 14:43:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 4635 states and 7573 transitions. [2025-01-09 14:43:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:43:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 7573 transitions. [2025-01-09 14:43:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:05,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:05,745 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:05,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:43:05,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1034560416, now seen corresponding path program 1 times [2025-01-09 14:43:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656797526] [2025-01-09 14:43:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:05,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:05,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:05,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:05,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656797526] [2025-01-09 14:43:06,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656797526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:06,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:06,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:43:06,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163361147] [2025-01-09 14:43:06,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:43:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:06,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:43:06,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:43:06,470 INFO L87 Difference]: Start difference. First operand 4635 states and 7573 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:06,637 INFO L93 Difference]: Finished difference Result 10455 states and 16969 transitions. [2025-01-09 14:43:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:43:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:43:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:06,657 INFO L225 Difference]: With dead ends: 10455 [2025-01-09 14:43:06,657 INFO L226 Difference]: Without dead ends: 5823 [2025-01-09 14:43:06,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:43:06,666 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 496 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:06,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1293 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5823 states. [2025-01-09 14:43:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5823 to 4635. [2025-01-09 14:43:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4635 states, 4379 states have (on average 1.61703585293446) internal successors, (7081), 4393 states have internal predecessors, (7081), 238 states have call successors, (238), 17 states have call predecessors, (238), 17 states have return successors, (238), 224 states have call predecessors, (238), 238 states have call successors, (238) [2025-01-09 14:43:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 7557 transitions. [2025-01-09 14:43:06,788 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 7557 transitions. Word has length 429 [2025-01-09 14:43:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:06,789 INFO L471 AbstractCegarLoop]: Abstraction has 4635 states and 7557 transitions. [2025-01-09 14:43:06,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 7557 transitions. [2025-01-09 14:43:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:43:06,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:06,821 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:06,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:43:06,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1097008288, now seen corresponding path program 1 times [2025-01-09 14:43:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420986923] [2025-01-09 14:43:06,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:06,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:43:06,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:43:06,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:06,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:07,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420986923] [2025-01-09 14:43:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420986923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303158490] [2025-01-09 14:43:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:07,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:07,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:07,041 INFO L87 Difference]: Start difference. First operand 4635 states and 7557 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:07,164 INFO L93 Difference]: Finished difference Result 9289 states and 15128 transitions. [2025-01-09 14:43:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:43:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:07,182 INFO L225 Difference]: With dead ends: 9289 [2025-01-09 14:43:07,183 INFO L226 Difference]: Without dead ends: 4657 [2025-01-09 14:43:07,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:07,192 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 229 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:07,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1064 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-01-09 14:43:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 3891. [2025-01-09 14:43:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3703 states have (on average 1.6389413988657846) internal successors, (6069), 3709 states have internal predecessors, (6069), 174 states have call successors, (174), 13 states have call predecessors, (174), 13 states have return successors, (174), 168 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 14:43:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 6417 transitions. [2025-01-09 14:43:07,294 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 6417 transitions. Word has length 429 [2025-01-09 14:43:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:07,294 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 6417 transitions. [2025-01-09 14:43:07,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 6417 transitions. [2025-01-09 14:43:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:43:07,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:07,300 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:07,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:43:07,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:07,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash -804155423, now seen corresponding path program 1 times [2025-01-09 14:43:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060715739] [2025-01-09 14:43:07,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:07,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:43:07,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:43:07,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:07,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060715739] [2025-01-09 14:43:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060715739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:43:08,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850229298] [2025-01-09 14:43:08,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:08,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:43:08,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:08,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:43:08,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:43:08,465 INFO L87 Difference]: Start difference. First operand 3891 states and 6417 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:08,831 INFO L93 Difference]: Finished difference Result 8977 states and 14734 transitions. [2025-01-09 14:43:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:43:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-01-09 14:43:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:08,856 INFO L225 Difference]: With dead ends: 8977 [2025-01-09 14:43:08,856 INFO L226 Difference]: Without dead ends: 5089 [2025-01-09 14:43:08,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:43:08,863 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 1438 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:08,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 2308 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:43:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2025-01-09 14:43:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 3971. [2025-01-09 14:43:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3783 states have (on average 1.6360031720856463) internal successors, (6189), 3789 states have internal predecessors, (6189), 174 states have call successors, (174), 13 states have call predecessors, (174), 13 states have return successors, (174), 168 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 14:43:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 6537 transitions. [2025-01-09 14:43:08,999 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 6537 transitions. Word has length 430 [2025-01-09 14:43:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:09,000 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 6537 transitions. [2025-01-09 14:43:09,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 6537 transitions. [2025-01-09 14:43:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:43:09,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:09,006 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:43:09,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1246828575, now seen corresponding path program 1 times [2025-01-09 14:43:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006320484] [2025-01-09 14:43:09,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:43:09,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:43:09,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:09,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006320484] [2025-01-09 14:43:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006320484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:10,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678595569] [2025-01-09 14:43:10,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:10,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:10,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:10,033 INFO L87 Difference]: Start difference. First operand 3971 states and 6537 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:10,637 INFO L93 Difference]: Finished difference Result 12819 states and 21016 transitions. [2025-01-09 14:43:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:43:10,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-01-09 14:43:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:10,659 INFO L225 Difference]: With dead ends: 12819 [2025-01-09 14:43:10,659 INFO L226 Difference]: Without dead ends: 8851 [2025-01-09 14:43:10,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:43:10,669 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1139 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:10,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 2078 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:43:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8851 states. [2025-01-09 14:43:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8851 to 8435. [2025-01-09 14:43:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8435 states, 7967 states have (on average 1.6303501945525292) internal successors, (12989), 7981 states have internal predecessors, (12989), 433 states have call successors, (433), 34 states have call predecessors, (433), 34 states have return successors, (433), 419 states have call predecessors, (433), 433 states have call successors, (433) [2025-01-09 14:43:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 13855 transitions. [2025-01-09 14:43:10,935 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 13855 transitions. Word has length 430 [2025-01-09 14:43:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:10,936 INFO L471 AbstractCegarLoop]: Abstraction has 8435 states and 13855 transitions. [2025-01-09 14:43:10,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 13855 transitions. [2025-01-09 14:43:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:43:10,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:10,944 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:43:10,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1337102111, now seen corresponding path program 1 times [2025-01-09 14:43:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:10,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743499494] [2025-01-09 14:43:10,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:10,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:43:12,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:43:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:12,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743499494] [2025-01-09 14:43:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743499494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442204982] [2025-01-09 14:43:13,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:13,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:43:13,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:43:13,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:43:13,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:43:13,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:13,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:13,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:43:13,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2388 proven. 144 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2025-01-09 14:43:14,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:43:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:14,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442204982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:43:14,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:43:14,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 15 [2025-01-09 14:43:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834890281] [2025-01-09 14:43:14,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:43:14,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:43:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:14,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:43:14,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:43:14,576 INFO L87 Difference]: Start difference. First operand 8435 states and 13855 transitions. Second operand has 15 states, 15 states have (on average 14.133333333333333) internal successors, (212), 15 states have internal predecessors, (212), 3 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (165), 3 states have call predecessors, (165), 3 states have call successors, (165) [2025-01-09 14:43:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:18,028 INFO L93 Difference]: Finished difference Result 31496 states and 50609 transitions. [2025-01-09 14:43:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-01-09 14:43:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 14.133333333333333) internal successors, (212), 15 states have internal predecessors, (212), 3 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (165), 3 states have call predecessors, (165), 3 states have call successors, (165) Word has length 430 [2025-01-09 14:43:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:18,076 INFO L225 Difference]: With dead ends: 31496 [2025-01-09 14:43:18,076 INFO L226 Difference]: Without dead ends: 23064 [2025-01-09 14:43:18,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2758 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1523, Invalid=6487, Unknown=0, NotChecked=0, Total=8010 [2025-01-09 14:43:18,095 INFO L435 NwaCegarLoop]: 1653 mSDtfsCounter, 3126 mSDsluCounter, 4995 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 6648 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:18,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 6648 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 14:43:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23064 states. [2025-01-09 14:43:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23064 to 21872. [2025-01-09 14:43:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21872 states, 20022 states have (on average 1.5629807212066726) internal successors, (31294), 20063 states have internal predecessors, (31294), 1554 states have call successors, (1554), 295 states have call predecessors, (1554), 295 states have return successors, (1554), 1513 states have call predecessors, (1554), 1554 states have call successors, (1554) [2025-01-09 14:43:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21872 states to 21872 states and 34402 transitions. [2025-01-09 14:43:18,877 INFO L78 Accepts]: Start accepts. Automaton has 21872 states and 34402 transitions. Word has length 430 [2025-01-09 14:43:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:18,878 INFO L471 AbstractCegarLoop]: Abstraction has 21872 states and 34402 transitions. [2025-01-09 14:43:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.133333333333333) internal successors, (212), 15 states have internal predecessors, (212), 3 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (165), 3 states have call predecessors, (165), 3 states have call successors, (165) [2025-01-09 14:43:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21872 states and 34402 transitions. [2025-01-09 14:43:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 14:43:18,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:18,896 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:18,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:43:19,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:19,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:19,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1794169479, now seen corresponding path program 1 times [2025-01-09 14:43:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649877584] [2025-01-09 14:43:19,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:19,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:43:19,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:43:19,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:19,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649877584] [2025-01-09 14:43:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649877584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:43:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539717462] [2025-01-09 14:43:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:43:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:19,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:43:19,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:43:19,444 INFO L87 Difference]: Start difference. First operand 21872 states and 34402 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:20,945 INFO L93 Difference]: Finished difference Result 79926 states and 126737 transitions. [2025-01-09 14:43:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:43:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 431 [2025-01-09 14:43:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:21,074 INFO L225 Difference]: With dead ends: 79926 [2025-01-09 14:43:21,074 INFO L226 Difference]: Without dead ends: 58124 [2025-01-09 14:43:21,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:21,112 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 603 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:21,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1564 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:43:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58124 states. [2025-01-09 14:43:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58124 to 43672. [2025-01-09 14:43:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43672 states, 40004 states have (on average 1.5595440455954404) internal successors, (62388), 40085 states have internal predecessors, (62388), 3084 states have call successors, (3084), 583 states have call predecessors, (3084), 583 states have return successors, (3084), 3003 states have call predecessors, (3084), 3084 states have call successors, (3084) [2025-01-09 14:43:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43672 states to 43672 states and 68556 transitions. [2025-01-09 14:43:22,945 INFO L78 Accepts]: Start accepts. Automaton has 43672 states and 68556 transitions. Word has length 431 [2025-01-09 14:43:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 43672 states and 68556 transitions. [2025-01-09 14:43:22,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 43672 states and 68556 transitions. [2025-01-09 14:43:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:43:23,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:23,009 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:23,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:43:23,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1582190173, now seen corresponding path program 1 times [2025-01-09 14:43:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826541381] [2025-01-09 14:43:23,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:23,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:43:23,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:43:23,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826541381] [2025-01-09 14:43:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826541381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866332534] [2025-01-09 14:43:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:23,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:23,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:23,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:23,820 INFO L87 Difference]: Start difference. First operand 43672 states and 68556 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:25,555 INFO L93 Difference]: Finished difference Result 120880 states and 189756 transitions. [2025-01-09 14:43:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:43:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 432 [2025-01-09 14:43:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:25,774 INFO L225 Difference]: With dead ends: 120880 [2025-01-09 14:43:25,774 INFO L226 Difference]: Without dead ends: 77278 [2025-01-09 14:43:25,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:43:25,828 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 870 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:25,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1935 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:43:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77278 states. [2025-01-09 14:43:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77278 to 44184. [2025-01-09 14:43:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44184 states, 40516 states have (on average 1.5469444170204363) internal successors, (62676), 40597 states have internal predecessors, (62676), 3084 states have call successors, (3084), 583 states have call predecessors, (3084), 583 states have return successors, (3084), 3003 states have call predecessors, (3084), 3084 states have call successors, (3084) [2025-01-09 14:43:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44184 states to 44184 states and 68844 transitions. [2025-01-09 14:43:27,436 INFO L78 Accepts]: Start accepts. Automaton has 44184 states and 68844 transitions. Word has length 432 [2025-01-09 14:43:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:27,436 INFO L471 AbstractCegarLoop]: Abstraction has 44184 states and 68844 transitions. [2025-01-09 14:43:27,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44184 states and 68844 transitions. [2025-01-09 14:43:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:43:27,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:27,467 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:27,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:43:27,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:27,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash 684191013, now seen corresponding path program 1 times [2025-01-09 14:43:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:27,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238480700] [2025-01-09 14:43:27,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:27,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:43:27,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:43:27,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:27,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:43:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238480700] [2025-01-09 14:43:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238480700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:43:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489407921] [2025-01-09 14:43:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:28,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:43:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:43:28,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:43:28,262 INFO L87 Difference]: Start difference. First operand 44184 states and 68844 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:29,746 INFO L93 Difference]: Finished difference Result 115932 states and 181458 transitions. [2025-01-09 14:43:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:43:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 432 [2025-01-09 14:43:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:29,881 INFO L225 Difference]: With dead ends: 115932 [2025-01-09 14:43:29,882 INFO L226 Difference]: Without dead ends: 71818 [2025-01-09 14:43:29,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:43:29,931 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 457 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:29,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1185 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71818 states. [2025-01-09 14:43:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71818 to 47832. [2025-01-09 14:43:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47832 states, 44164 states have (on average 1.5553844760438367) internal successors, (68692), 44245 states have internal predecessors, (68692), 3084 states have call successors, (3084), 583 states have call predecessors, (3084), 583 states have return successors, (3084), 3003 states have call predecessors, (3084), 3084 states have call successors, (3084) [2025-01-09 14:43:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47832 states to 47832 states and 74860 transitions. [2025-01-09 14:43:31,495 INFO L78 Accepts]: Start accepts. Automaton has 47832 states and 74860 transitions. Word has length 432 [2025-01-09 14:43:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:31,496 INFO L471 AbstractCegarLoop]: Abstraction has 47832 states and 74860 transitions. [2025-01-09 14:43:31,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:43:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47832 states and 74860 transitions. [2025-01-09 14:43:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:43:31,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:31,520 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:31,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:43:31,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:31,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 611804455, now seen corresponding path program 1 times [2025-01-09 14:43:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511130155] [2025-01-09 14:43:31,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:31,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:43:31,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:43:31,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:31,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:32,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:32,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511130155] [2025-01-09 14:43:32,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511130155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:32,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182788465] [2025-01-09 14:43:32,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:32,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:32,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:32,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:43:32,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:43:32,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:43:32,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:43:32,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:32,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:32,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:43:32,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3798 proven. 27 refuted. 0 times theorem prover too weak. 3495 trivial. 0 not checked. [2025-01-09 14:43:32,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:43:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182788465] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:43:32,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:43:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-01-09 14:43:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99640261] [2025-01-09 14:43:32,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:43:32,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:43:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:32,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:43:32,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:43:33,000 INFO L87 Difference]: Start difference. First operand 47832 states and 74860 transitions. Second operand has 15 states, 15 states have (on average 15.266666666666667) internal successors, (229), 15 states have internal predecessors, (229), 6 states have call successors, (134), 3 states have call predecessors, (134), 6 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) [2025-01-09 14:43:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:34,212 INFO L93 Difference]: Finished difference Result 67846 states and 105972 transitions. [2025-01-09 14:43:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:43:34,213 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.266666666666667) internal successors, (229), 15 states have internal predecessors, (229), 6 states have call successors, (134), 3 states have call predecessors, (134), 6 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) Word has length 432 [2025-01-09 14:43:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:34,265 INFO L225 Difference]: With dead ends: 67846 [2025-01-09 14:43:34,265 INFO L226 Difference]: Without dead ends: 20084 [2025-01-09 14:43:34,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:43:34,309 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 897 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:34,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1615 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:43:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20084 states. [2025-01-09 14:43:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20084 to 19810. [2025-01-09 14:43:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19810 states, 17972 states have (on average 1.5403961718228356) internal successors, (27684), 17997 states have internal predecessors, (27684), 1554 states have call successors, (1554), 283 states have call predecessors, (1554), 283 states have return successors, (1554), 1529 states have call predecessors, (1554), 1554 states have call successors, (1554) [2025-01-09 14:43:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19810 states to 19810 states and 30792 transitions. [2025-01-09 14:43:35,281 INFO L78 Accepts]: Start accepts. Automaton has 19810 states and 30792 transitions. Word has length 432 [2025-01-09 14:43:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 19810 states and 30792 transitions. [2025-01-09 14:43:35,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.266666666666667) internal successors, (229), 15 states have internal predecessors, (229), 6 states have call successors, (134), 3 states have call predecessors, (134), 6 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) [2025-01-09 14:43:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19810 states and 30792 transitions. [2025-01-09 14:43:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-09 14:43:35,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:35,294 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:35,303 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-01-09 14:43:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:35,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:35,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1021819804, now seen corresponding path program 1 times [2025-01-09 14:43:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175746685] [2025-01-09 14:43:35,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:35,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:43:36,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:43:36,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:36,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:36,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:36,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175746685] [2025-01-09 14:43:36,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175746685] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:36,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487473844] [2025-01-09 14:43:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:36,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:36,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:43:36,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:43:36,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:43:37,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:43:37,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:37,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:37,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 14:43:37,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4806 proven. 258 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2025-01-09 14:43:37,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:43:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 264 proven. 267 refuted. 0 times theorem prover too weak. 6789 trivial. 0 not checked. [2025-01-09 14:43:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487473844] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:43:38,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:43:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 29 [2025-01-09 14:43:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65738778] [2025-01-09 14:43:38,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:43:38,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 14:43:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:38,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 14:43:38,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:43:38,641 INFO L87 Difference]: Start difference. First operand 19810 states and 30792 transitions. Second operand has 29 states, 27 states have (on average 10.407407407407407) internal successors, (281), 27 states have internal predecessors, (281), 9 states have call successors, (137), 4 states have call predecessors, (137), 9 states have return successors, (139), 8 states have call predecessors, (139), 9 states have call successors, (139) [2025-01-09 14:43:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:45,615 INFO L93 Difference]: Finished difference Result 84756 states and 132441 transitions. [2025-01-09 14:43:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-01-09 14:43:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 10.407407407407407) internal successors, (281), 27 states have internal predecessors, (281), 9 states have call successors, (137), 4 states have call predecessors, (137), 9 states have return successors, (139), 8 states have call predecessors, (139), 9 states have call successors, (139) Word has length 433 [2025-01-09 14:43:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:45,744 INFO L225 Difference]: With dead ends: 84756 [2025-01-09 14:43:45,745 INFO L226 Difference]: Without dead ends: 65002 [2025-01-09 14:43:45,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5126 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2977, Invalid=11543, Unknown=0, NotChecked=0, Total=14520 [2025-01-09 14:43:45,791 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 7434 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 2239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7434 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 4517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2239 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:45,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7434 Valid, 2831 Invalid, 4517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2239 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 14:43:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65002 states. [2025-01-09 14:43:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65002 to 38718. [2025-01-09 14:43:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38718 states, 35372 states have (on average 1.5364695239172226) internal successors, (54348), 35437 states have internal predecessors, (54348), 2634 states have call successors, (2634), 711 states have call predecessors, (2634), 711 states have return successors, (2634), 2569 states have call predecessors, (2634), 2634 states have call successors, (2634) [2025-01-09 14:43:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 59616 transitions. [2025-01-09 14:43:47,454 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 59616 transitions. Word has length 433 [2025-01-09 14:43:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 38718 states and 59616 transitions. [2025-01-09 14:43:47,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 10.407407407407407) internal successors, (281), 27 states have internal predecessors, (281), 9 states have call successors, (137), 4 states have call predecessors, (137), 9 states have return successors, (139), 8 states have call predecessors, (139), 9 states have call successors, (139) [2025-01-09 14:43:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 59616 transitions. [2025-01-09 14:43:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-09 14:43:47,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:47,465 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:43:47,477 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-01-09 14:43:47,665 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,SelfDestructingSolverStorable15 [2025-01-09 14:43:47,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:47,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 424716068, now seen corresponding path program 1 times [2025-01-09 14:43:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704739880] [2025-01-09 14:43:47,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:47,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:43:50,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:43:50,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:50,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704739880] [2025-01-09 14:43:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704739880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391851561] [2025-01-09 14:43:52,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:52,846 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-01-09 14:43:52,848 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-01-09 14:43:53,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:43:53,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:43:53,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:53,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:53,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:43:53,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3752 proven. 174 refuted. 0 times theorem prover too weak. 3394 trivial. 0 not checked. [2025-01-09 14:43:54,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:43:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:43:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391851561] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:43:54,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:43:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 33 [2025-01-09 14:43:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142779476] [2025-01-09 14:43:54,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:43:54,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 14:43:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:54,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 14:43:54,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:43:54,633 INFO L87 Difference]: Start difference. First operand 38718 states and 59616 transitions. Second operand has 33 states, 32 states have (on average 10.6875) internal successors, (342), 32 states have internal predecessors, (342), 8 states have call successors, (152), 3 states have call predecessors, (152), 5 states have return successors, (153), 7 states have call predecessors, (153), 8 states have call successors, (153)