./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.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_amount250_file-78.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 ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:28:09,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:28:10,062 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:28:10,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:28:10,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:28:10,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:28:10,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:28:10,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:28:10,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:28:10,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:28:10,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:28:10,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:28:10,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:28:10,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:28:10,102 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:28:10,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:28:10,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:28:10,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:10,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:10,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:10,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:28:10,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:28:10,105 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 -> ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 [2025-01-09 14:28:10,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:28:10,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:28:10,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:28:10,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:28:10,427 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:28:10,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-01-09 14:28:11,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/705334253/fd7c2ed0b34f4ac788e2df01a06e3ba0/FLAG518e35f03 [2025-01-09 14:28:12,206 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:28:12,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-01-09 14:28:12,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/705334253/fd7c2ed0b34f4ac788e2df01a06e3ba0/FLAG518e35f03 [2025-01-09 14:28:12,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/705334253/fd7c2ed0b34f4ac788e2df01a06e3ba0 [2025-01-09 14:28:12,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:28:12,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:28:12,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:12,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:28:12,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:28:12,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b105aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12, skipping insertion in model container [2025-01-09 14:28:12,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:28:12,443 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_amount250_file-78.i[916,929] [2025-01-09 14:28:12,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:12,645 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:28:12,656 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_amount250_file-78.i[916,929] [2025-01-09 14:28:12,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:12,769 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:28:12,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12 WrapperNode [2025-01-09 14:28:12,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:12,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:12,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:28:12,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:28:12,778 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:28:12" (1/1) ... [2025-01-09 14:28:12,799 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:28:12" (1/1) ... [2025-01-09 14:28:12,870 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2025-01-09 14:28:12,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:12,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:28:12,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:28:12,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:28:12,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,927 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:28:12,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:12,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:28:12,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:28:12,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:28:12,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:28:13,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (1/1) ... [2025-01-09 14:28:13,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:13,031 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:28:13,038 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:28:13,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:28:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:28:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:28:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:28:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:28:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:28:13,170 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:28:13,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:28:14,108 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-01-09 14:28:14,108 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:28:14,124 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:28:14,126 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:28:14,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:14 BoogieIcfgContainer [2025-01-09 14:28:14,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:28:14,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:28:14,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:28:14,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:28:14,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:28:12" (1/3) ... [2025-01-09 14:28:14,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a17e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:14, skipping insertion in model container [2025-01-09 14:28:14,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:12" (2/3) ... [2025-01-09 14:28:14,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a17e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:14, skipping insertion in model container [2025-01-09 14:28:14,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:14" (3/3) ... [2025-01-09 14:28:14,138 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-78.i [2025-01-09 14:28:14,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:28:14,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-78.i that has 2 procedures, 201 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:28:14,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:28:14,232 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;@19021618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:28:14,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:28:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:28:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:28:14,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:14,252 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:14,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:14,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -180085850, now seen corresponding path program 1 times [2025-01-09 14:28:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:14,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985798849] [2025-01-09 14:28:14,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:14,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:28:14,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:28:14,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:14,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:28:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985798849] [2025-01-09 14:28:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985798849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:15,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660822956] [2025-01-09 14:28:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:15,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:15,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:15,105 INFO L87 Difference]: Start difference. First operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:15,310 INFO L93 Difference]: Finished difference Result 588 states and 1077 transitions. [2025-01-09 14:28:15,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-01-09 14:28:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:15,327 INFO L225 Difference]: With dead ends: 588 [2025-01-09 14:28:15,327 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 14:28:15,333 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:28:15,337 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 297 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:15,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 643 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 14:28:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-01-09 14:28:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 271 states have (on average 1.4612546125461254) internal successors, (396), 271 states have internal predecessors, (396), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 14:28:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 620 transitions. [2025-01-09 14:28:15,447 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 620 transitions. Word has length 365 [2025-01-09 14:28:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:15,449 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 620 transitions. [2025-01-09 14:28:15,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 620 transitions. [2025-01-09 14:28:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 14:28:15,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:15,462 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:15,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:28:15,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:15,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1046429159, now seen corresponding path program 1 times [2025-01-09 14:28:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798001741] [2025-01-09 14:28:15,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:15,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:28:15,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:28:15,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:28:15,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798001741] [2025-01-09 14:28:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798001741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:15,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:15,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370886456] [2025-01-09 14:28:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:15,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:15,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:15,836 INFO L87 Difference]: Start difference. First operand 386 states and 620 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:16,002 INFO L93 Difference]: Finished difference Result 779 states and 1253 transitions. [2025-01-09 14:28:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-01-09 14:28:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:16,011 INFO L225 Difference]: With dead ends: 779 [2025-01-09 14:28:16,012 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 14:28:16,014 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:28:16,015 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 281 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:16,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 770 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 14:28:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2025-01-09 14:28:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 277 states have (on average 1.44043321299639) internal successors, (399), 277 states have internal predecessors, (399), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 14:28:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 623 transitions. [2025-01-09 14:28:16,072 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 623 transitions. Word has length 366 [2025-01-09 14:28:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:16,073 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 623 transitions. [2025-01-09 14:28:16,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 623 transitions. [2025-01-09 14:28:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 14:28:16,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:16,081 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:16,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:28:16,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1864077609, now seen corresponding path program 1 times [2025-01-09 14:28:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448867825] [2025-01-09 14:28:16,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:16,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:28:16,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:28:16,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:16,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:28:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448867825] [2025-01-09 14:28:17,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448867825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:17,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:17,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:28:17,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708631712] [2025-01-09 14:28:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:17,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:28:17,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:17,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:28:17,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:28:17,563 INFO L87 Difference]: Start difference. First operand 392 states and 623 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:18,548 INFO L93 Difference]: Finished difference Result 1422 states and 2257 transitions. [2025-01-09 14:28:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:28:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-01-09 14:28:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:18,558 INFO L225 Difference]: With dead ends: 1422 [2025-01-09 14:28:18,558 INFO L226 Difference]: Without dead ends: 1033 [2025-01-09 14:28:18,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:28:18,561 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 936 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:18,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1601 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:28:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-01-09 14:28:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 771. [2025-01-09 14:28:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 550 states have (on average 1.4363636363636363) internal successors, (790), 551 states have internal predecessors, (790), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 215 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 14:28:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1222 transitions. [2025-01-09 14:28:18,678 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1222 transitions. Word has length 366 [2025-01-09 14:28:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1222 transitions. [2025-01-09 14:28:18,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1222 transitions. [2025-01-09 14:28:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 14:28:18,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:18,685 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:18,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:28:18,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:18,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1927856238, now seen corresponding path program 1 times [2025-01-09 14:28:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:18,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271898787] [2025-01-09 14:28:18,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:18,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 14:28:18,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 14:28:18,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:18,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:28:19,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271898787] [2025-01-09 14:28:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271898787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:19,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:19,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:28:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43620890] [2025-01-09 14:28:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:19,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:28:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:19,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:28:19,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:28:19,585 INFO L87 Difference]: Start difference. First operand 771 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:20,223 INFO L93 Difference]: Finished difference Result 2835 states and 4486 transitions. [2025-01-09 14:28:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:28:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-01-09 14:28:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:20,243 INFO L225 Difference]: With dead ends: 2835 [2025-01-09 14:28:20,244 INFO L226 Difference]: Without dead ends: 2067 [2025-01-09 14:28:20,248 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:28:20,249 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 573 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:20,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1005 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:28:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-01-09 14:28:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1619. [2025-01-09 14:28:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1234 states have (on average 1.46677471636953) internal successors, (1810), 1239 states have internal predecessors, (1810), 376 states have call successors, (376), 8 states have call predecessors, (376), 8 states have return successors, (376), 371 states have call predecessors, (376), 376 states have call successors, (376) [2025-01-09 14:28:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2562 transitions. [2025-01-09 14:28:20,454 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2562 transitions. Word has length 367 [2025-01-09 14:28:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:20,455 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2562 transitions. [2025-01-09 14:28:20,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2562 transitions. [2025-01-09 14:28:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 14:28:20,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:20,467 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:20,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:28:20,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:20,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1446775980, now seen corresponding path program 1 times [2025-01-09 14:28:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:20,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507942536] [2025-01-09 14:28:20,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:20,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 14:28:20,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 14:28:20,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:20,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:28:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:20,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507942536] [2025-01-09 14:28:20,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507942536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:20,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:20,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689068542] [2025-01-09 14:28:20,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:20,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:20,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:20,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:20,957 INFO L87 Difference]: Start difference. First operand 1619 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:21,205 INFO L93 Difference]: Finished difference Result 4067 states and 6443 transitions. [2025-01-09 14:28:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:21,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-01-09 14:28:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:21,228 INFO L225 Difference]: With dead ends: 4067 [2025-01-09 14:28:21,228 INFO L226 Difference]: Without dead ends: 2451 [2025-01-09 14:28:21,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:28:21,235 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 214 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:21,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 779 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:28:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-01-09 14:28:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-01-09 14:28:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 1803 states have (on average 1.442595673876872) internal successors, (2601), 1810 states have internal predecessors, (2601), 632 states have call successors, (632), 13 states have call predecessors, (632), 13 states have return successors, (632), 625 states have call predecessors, (632), 632 states have call successors, (632) [2025-01-09 14:28:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3865 transitions. [2025-01-09 14:28:21,546 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3865 transitions. Word has length 367 [2025-01-09 14:28:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:21,547 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3865 transitions. [2025-01-09 14:28:21,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3865 transitions. [2025-01-09 14:28:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 14:28:21,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:21,552 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:21,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:28:21,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash -613230811, now seen corresponding path program 1 times [2025-01-09 14:28:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984552274] [2025-01-09 14:28:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:21,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 14:28:22,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 14:28:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:28:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984552274] [2025-01-09 14:28:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984552274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900863442] [2025-01-09 14:28:22,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:22,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:22,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:22,582 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:28:22,584 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:28:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 14:28:22,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 14:28:22,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:22,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:28:22,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 483 proven. 159 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-01-09 14:28:23,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:28:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900863442] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:28:24,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:28:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 14:28:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955297831] [2025-01-09 14:28:24,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:24,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:28:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:24,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:28:24,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:28:24,136 INFO L87 Difference]: Start difference. First operand 2449 states and 3865 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-01-09 14:28:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:24,953 INFO L93 Difference]: Finished difference Result 4893 states and 7673 transitions. [2025-01-09 14:28:24,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:28:24,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) Word has length 368 [2025-01-09 14:28:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:24,980 INFO L225 Difference]: With dead ends: 4893 [2025-01-09 14:28:24,980 INFO L226 Difference]: Without dead ends: 2515 [2025-01-09 14:28:25,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:28:25,013 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 241 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:25,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1054 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:28:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-01-09 14:28:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2489. [2025-01-09 14:28:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 1830 states have (on average 1.4229508196721312) internal successors, (2604), 1837 states have internal predecessors, (2604), 632 states have call successors, (632), 26 states have call predecessors, (632), 26 states have return successors, (632), 625 states have call predecessors, (632), 632 states have call successors, (632) [2025-01-09 14:28:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3868 transitions. [2025-01-09 14:28:25,304 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3868 transitions. Word has length 368 [2025-01-09 14:28:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:25,305 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3868 transitions. [2025-01-09 14:28:25,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-01-09 14:28:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3868 transitions. [2025-01-09 14:28:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 14:28:25,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:25,311 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:25,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:28:25,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:25,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:25,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1457236313, now seen corresponding path program 1 times [2025-01-09 14:28:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805484424] [2025-01-09 14:28:25,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:25,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 14:28:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 14:28:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:28:27,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:27,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805484424] [2025-01-09 14:28:27,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805484424] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:27,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109059960] [2025-01-09 14:28:27,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:27,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:27,216 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:28:27,218 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:28:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 14:28:27,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 14:28:27,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:27,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:27,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:28:27,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2905 proven. 267 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2025-01-09 14:28:29,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109059960] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:30,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:28:30,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2025-01-09 14:28:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491770740] [2025-01-09 14:28:30,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:28:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:28:30,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:28:30,287 INFO L87 Difference]: Start difference. First operand 2489 states and 3868 transitions. Second operand has 18 states, 18 states have (on average 9.444444444444445) internal successors, (170), 18 states have internal predecessors, (170), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-01-09 14:28:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:34,495 INFO L93 Difference]: Finished difference Result 8527 states and 12943 transitions. [2025-01-09 14:28:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 14:28:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.444444444444445) internal successors, (170), 18 states have internal predecessors, (170), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) Word has length 368 [2025-01-09 14:28:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:34,530 INFO L225 Difference]: With dead ends: 8527 [2025-01-09 14:28:34,530 INFO L226 Difference]: Without dead ends: 6113 [2025-01-09 14:28:34,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=670, Invalid=1880, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 14:28:34,542 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2580 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2580 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:34,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2580 Valid, 1516 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:28:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2025-01-09 14:28:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 4117. [2025-01-09 14:28:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 3369 states have (on average 1.4568121104185219) internal successors, (4908), 3388 states have internal predecessors, (4908), 656 states have call successors, (656), 91 states have call predecessors, (656), 91 states have return successors, (656), 637 states have call predecessors, (656), 656 states have call successors, (656) [2025-01-09 14:28:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 6220 transitions. [2025-01-09 14:28:34,914 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 6220 transitions. Word has length 368 [2025-01-09 14:28:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:34,914 INFO L471 AbstractCegarLoop]: Abstraction has 4117 states and 6220 transitions. [2025-01-09 14:28:34,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.444444444444445) internal successors, (170), 18 states have internal predecessors, (170), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-01-09 14:28:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 6220 transitions. [2025-01-09 14:28:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:28:34,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:34,921 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:34,931 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:28:35,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:35,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:35,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1309555176, now seen corresponding path program 1 times [2025-01-09 14:28:35,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:35,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631949150] [2025-01-09 14:28:35,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:35,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:35,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:28:35,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:28:35,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:28:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631949150] [2025-01-09 14:28:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631949150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186337389] [2025-01-09 14:28:36,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:36,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:36,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:36,307 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:28:36,310 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:28:36,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:28:36,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:28:36,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:36,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:36,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:28:36,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1329 proven. 18 refuted. 0 times theorem prover too weak. 4813 trivial. 0 not checked. [2025-01-09 14:28:36,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 147 proven. 18 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:28:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186337389] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:28:36,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:28:36,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-01-09 14:28:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739908588] [2025-01-09 14:28:36,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:36,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:28:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:36,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:28:36,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:28:36,986 INFO L87 Difference]: Start difference. First operand 4117 states and 6220 transitions. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-01-09 14:28:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:38,625 INFO L93 Difference]: Finished difference Result 8406 states and 12671 transitions. [2025-01-09 14:28:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:28:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 369 [2025-01-09 14:28:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:38,651 INFO L225 Difference]: With dead ends: 8406 [2025-01-09 14:28:38,651 INFO L226 Difference]: Without dead ends: 4304 [2025-01-09 14:28:38,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 741 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:28:38,665 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1277 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:38,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1216 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:28:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2025-01-09 14:28:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 4060. [2025-01-09 14:28:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 3450 states have (on average 1.467536231884058) internal successors, (5063), 3463 states have internal predecessors, (5063), 514 states have call successors, (514), 95 states have call predecessors, (514), 95 states have return successors, (514), 501 states have call predecessors, (514), 514 states have call successors, (514) [2025-01-09 14:28:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 6091 transitions. [2025-01-09 14:28:39,022 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 6091 transitions. Word has length 369 [2025-01-09 14:28:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:39,022 INFO L471 AbstractCegarLoop]: Abstraction has 4060 states and 6091 transitions. [2025-01-09 14:28:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-01-09 14:28:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 6091 transitions. [2025-01-09 14:28:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:28:39,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:39,028 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:39,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:28:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:39,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:39,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash -451077563, now seen corresponding path program 1 times [2025-01-09 14:28:39,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907943918] [2025-01-09 14:28:39,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:39,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:28:39,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:28:39,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:39,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:28:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907943918] [2025-01-09 14:28:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907943918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626946701] [2025-01-09 14:28:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:39,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:39,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:39,536 INFO L87 Difference]: Start difference. First operand 4060 states and 6091 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:39,924 INFO L93 Difference]: Finished difference Result 9878 states and 14798 transitions. [2025-01-09 14:28:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 369 [2025-01-09 14:28:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:39,967 INFO L225 Difference]: With dead ends: 9878 [2025-01-09 14:28:39,967 INFO L226 Difference]: Without dead ends: 5917 [2025-01-09 14:28:39,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:28:39,977 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 186 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:39,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 637 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:28:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2025-01-09 14:28:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5915. [2025-01-09 14:28:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 4948 states have (on average 1.4478577202910268) internal successors, (7164), 4970 states have internal predecessors, (7164), 814 states have call successors, (814), 152 states have call predecessors, (814), 152 states have return successors, (814), 792 states have call predecessors, (814), 814 states have call successors, (814) [2025-01-09 14:28:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 8792 transitions. [2025-01-09 14:28:40,429 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 8792 transitions. Word has length 369 [2025-01-09 14:28:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:40,430 INFO L471 AbstractCegarLoop]: Abstraction has 5915 states and 8792 transitions. [2025-01-09 14:28:40,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:28:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 8792 transitions. [2025-01-09 14:28:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 14:28:40,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:40,435 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:28:40,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -189987138, now seen corresponding path program 1 times [2025-01-09 14:28:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010746180] [2025-01-09 14:28:40,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:40,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 14:28:40,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 14:28:40,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 45 proven. 279 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-01-09 14:28:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010746180] [2025-01-09 14:28:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010746180] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613881018] [2025-01-09 14:28:41,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:41,636 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:28:41,638 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:28:41,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 14:28:41,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 14:28:41,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:41,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:41,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 14:28:41,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2277 proven. 660 refuted. 0 times theorem prover too weak. 3223 trivial. 0 not checked. [2025-01-09 14:28:44,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 111 proven. 375 refuted. 0 times theorem prover too weak. 5674 trivial. 0 not checked. [2025-01-09 14:28:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613881018] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:28:46,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:28:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 14] total 38 [2025-01-09 14:28:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920480865] [2025-01-09 14:28:46,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:46,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 14:28:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:46,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 14:28:46,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 14:28:46,618 INFO L87 Difference]: Start difference. First operand 5915 states and 8792 transitions. Second operand has 38 states, 36 states have (on average 7.166666666666667) internal successors, (258), 36 states have internal predecessors, (258), 12 states have call successors, (162), 6 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 12 states have call successors, (163) [2025-01-09 14:28:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:56,867 INFO L93 Difference]: Finished difference Result 36172 states and 52023 transitions. [2025-01-09 14:28:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2025-01-09 14:28:56,868 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 7.166666666666667) internal successors, (258), 36 states have internal predecessors, (258), 12 states have call successors, (162), 6 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 12 states have call successors, (163) Word has length 370 [2025-01-09 14:28:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:56,971 INFO L225 Difference]: With dead ends: 36172 [2025-01-09 14:28:56,971 INFO L226 Difference]: Without dead ends: 30356 [2025-01-09 14:28:56,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12081 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6020, Invalid=25842, Unknown=0, NotChecked=0, Total=31862 [2025-01-09 14:28:56,999 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 3322 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 4963 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 5732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 4963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:56,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3324 Valid, 4502 Invalid, 5732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 4963 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 14:28:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30356 states. [2025-01-09 14:28:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30356 to 11576. [2025-01-09 14:28:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11576 states, 9612 states have (on average 1.4301914273824385) internal successors, (13747), 9649 states have internal predecessors, (13747), 1558 states have call successors, (1558), 405 states have call predecessors, (1558), 405 states have return successors, (1558), 1521 states have call predecessors, (1558), 1558 states have call successors, (1558) [2025-01-09 14:28:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11576 states to 11576 states and 16863 transitions. [2025-01-09 14:28:58,925 INFO L78 Accepts]: Start accepts. Automaton has 11576 states and 16863 transitions. Word has length 370 [2025-01-09 14:28:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:58,927 INFO L471 AbstractCegarLoop]: Abstraction has 11576 states and 16863 transitions. [2025-01-09 14:28:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 7.166666666666667) internal successors, (258), 36 states have internal predecessors, (258), 12 states have call successors, (162), 6 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 12 states have call successors, (163) [2025-01-09 14:28:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 11576 states and 16863 transitions. [2025-01-09 14:28:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 14:28:58,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:58,937 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:28:59,137 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,SelfDestructingSolverStorable9 [2025-01-09 14:28:59,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:59,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash -543075520, now seen corresponding path program 1 times [2025-01-09 14:28:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:59,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58376613] [2025-01-09 14:28:59,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:59,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 14:28:59,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 14:28:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 45 proven. 279 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-01-09 14:29:00,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58376613] [2025-01-09 14:29:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58376613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283154543] [2025-01-09 14:29:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:00,222 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:29:00,225 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:29:00,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 14:29:00,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 14:29:00,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:00,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:00,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 14:29:00,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3744 proven. 432 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 14:29:02,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 192 proven. 450 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-01-09 14:29:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283154543] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:03,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 34 [2025-01-09 14:29:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116850209] [2025-01-09 14:29:03,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:03,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 14:29:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:03,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 14:29:03,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:29:03,528 INFO L87 Difference]: Start difference. First operand 11576 states and 16863 transitions. Second operand has 34 states, 32 states have (on average 7.375) internal successors, (236), 32 states have internal predecessors, (236), 12 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 12 states have call successors, (163) [2025-01-09 14:29:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:09,942 INFO L93 Difference]: Finished difference Result 40516 states and 58566 transitions. [2025-01-09 14:29:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-01-09 14:29:09,943 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 7.375) internal successors, (236), 32 states have internal predecessors, (236), 12 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 12 states have call successors, (163) Word has length 370 [2025-01-09 14:29:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:10,025 INFO L225 Difference]: With dead ends: 40516 [2025-01-09 14:29:10,026 INFO L226 Difference]: Without dead ends: 29055 [2025-01-09 14:29:10,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2690, Invalid=7816, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 14:29:10,054 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 5356 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5356 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:10,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5356 Valid, 1923 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:29:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29055 states. [2025-01-09 14:29:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29055 to 8125. [2025-01-09 14:29:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8125 states, 7107 states have (on average 1.4214155058393134) internal successors, (10102), 7114 states have internal predecessors, (10102), 784 states have call successors, (784), 233 states have call predecessors, (784), 233 states have return successors, (784), 777 states have call predecessors, (784), 784 states have call successors, (784) [2025-01-09 14:29:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8125 states to 8125 states and 11670 transitions. [2025-01-09 14:29:11,187 INFO L78 Accepts]: Start accepts. Automaton has 8125 states and 11670 transitions. Word has length 370 [2025-01-09 14:29:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:11,188 INFO L471 AbstractCegarLoop]: Abstraction has 8125 states and 11670 transitions. [2025-01-09 14:29:11,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 7.375) internal successors, (236), 32 states have internal predecessors, (236), 12 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 12 states have call successors, (163) [2025-01-09 14:29:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8125 states and 11670 transitions. [2025-01-09 14:29:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-09 14:29:11,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:11,194 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:11,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:29:11,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 14:29:11,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:11,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash -540152184, now seen corresponding path program 1 times [2025-01-09 14:29:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:11,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478938065] [2025-01-09 14:29:11,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:11,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-09 14:29:11,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-09 14:29:11,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:11,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:29:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478938065] [2025-01-09 14:29:12,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478938065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492136669] [2025-01-09 14:29:12,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:12,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:12,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:12,503 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:29:12,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:29:12,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-09 14:29:12,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-09 14:29:12,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:12,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:12,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 14:29:12,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3557 proven. 798 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2025-01-09 14:29:16,825 INFO L312 TraceCheckSpWp]: Computing backward predicates...