./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.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_fillercode_fillercodesize_ps-cn-250_file-36.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 08d675ba4148739e9e7cf1bbda146cfc1e7cae9e235e349f1daedec05eaa7d10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:42:04,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:42:04,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:42:04,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:42:04,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:42:04,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:42:04,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:42:04,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:42:04,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:42:04,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:42:04,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:42:04,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:42:04,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:42:04,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:42:04,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:04,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:42:04,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:04,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:42:04,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:42:04,308 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 -> 08d675ba4148739e9e7cf1bbda146cfc1e7cae9e235e349f1daedec05eaa7d10 [2025-01-09 09:42:04,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:42:04,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:42:04,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:42:04,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:42:04,536 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:42:04,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-01-09 09:42:05,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c2ff8b46/1ec2b642d9ed48039d87254609fd0c90/FLAG7d46d8b36 [2025-01-09 09:42:05,967 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:42:05,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-01-09 09:42:05,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c2ff8b46/1ec2b642d9ed48039d87254609fd0c90/FLAG7d46d8b36 [2025-01-09 09:42:05,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c2ff8b46/1ec2b642d9ed48039d87254609fd0c90 [2025-01-09 09:42:05,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:42:05,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:42:05,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:42:05,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:42:05,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:42:05,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:05" (1/1) ... [2025-01-09 09:42:05,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:05, skipping insertion in model container [2025-01-09 09:42:05,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:05" (1/1) ... [2025-01-09 09:42:06,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:42:06,112 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_fillercode_fillercodesize_ps-cn-250_file-36.i[916,929] [2025-01-09 09:42:06,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:42:06,212 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:42:06,222 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_fillercode_fillercodesize_ps-cn-250_file-36.i[916,929] [2025-01-09 09:42:06,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:42:06,292 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:42:06,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06 WrapperNode [2025-01-09 09:42:06,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:42:06,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:42:06,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:42:06,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:42:06,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,376 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 612 [2025-01-09 09:42:06,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:42:06,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:42:06,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:42:06,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:42:06,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,421 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 09:42:06,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:42:06,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:42:06,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:42:06,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:42:06,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (1/1) ... [2025-01-09 09:42:06,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:06,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:06,502 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 09:42:06,508 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 09:42:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:42:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:42:06,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:42:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:42:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:42:06,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:42:06,643 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:42:06,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:42:07,520 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 09:42:07,521 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:42:07,537 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:42:07,541 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:42:07,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:42:07 BoogieIcfgContainer [2025-01-09 09:42:07,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:42:07,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:42:07,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:42:07,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:42:07,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:42:05" (1/3) ... [2025-01-09 09:42:07,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0cd890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:42:07, skipping insertion in model container [2025-01-09 09:42:07,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:06" (2/3) ... [2025-01-09 09:42:07,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0cd890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:42:07, skipping insertion in model container [2025-01-09 09:42:07,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:42:07" (3/3) ... [2025-01-09 09:42:07,551 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-01-09 09:42:07,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:42:07,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-36.i that has 2 procedures, 262 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:42:07,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:42:07,631 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;@54542dcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:42:07,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:42:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 09:42:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 09:42:07,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:07,667 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:07,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 189819328, now seen corresponding path program 1 times [2025-01-09 09:42:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34404866] [2025-01-09 09:42:07,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:07,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:07,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 09:42:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 09:42:08,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:08,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34404866] [2025-01-09 09:42:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34404866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138663819] [2025-01-09 09:42:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:08,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:08,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:08,536 INFO L87 Difference]: Start difference. First operand has 262 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:08,707 INFO L93 Difference]: Finished difference Result 664 states and 1237 transitions. [2025-01-09 09:42:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:08,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-01-09 09:42:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:08,722 INFO L225 Difference]: With dead ends: 664 [2025-01-09 09:42:08,722 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 09:42:08,729 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 09:42:08,731 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 208 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 918 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:42:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 09:42:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2025-01-09 09:42:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 269 states have (on average 1.479553903345725) internal successors, (398), 270 states have internal predecessors, (398), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2025-01-09 09:42:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 658 transitions. [2025-01-09 09:42:08,844 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 658 transitions. Word has length 574 [2025-01-09 09:42:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:08,848 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 658 transitions. [2025-01-09 09:42:08,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 658 transitions. [2025-01-09 09:42:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 09:42:08,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:08,863 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:42:08,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:08,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -831249026, now seen corresponding path program 1 times [2025-01-09 09:42:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576328447] [2025-01-09 09:42:08,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:08,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 09:42:08,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 09:42:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576328447] [2025-01-09 09:42:09,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576328447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:09,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:09,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:09,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942562503] [2025-01-09 09:42:09,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:09,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:09,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:09,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:09,310 INFO L87 Difference]: Start difference. First operand 402 states and 658 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:09,395 INFO L93 Difference]: Finished difference Result 841 states and 1374 transitions. [2025-01-09 09:42:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-01-09 09:42:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:09,404 INFO L225 Difference]: With dead ends: 841 [2025-01-09 09:42:09,407 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 09:42:09,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:09,410 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 26 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:09,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 818 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 09:42:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 422. [2025-01-09 09:42:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 290 states have internal predecessors, (426), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2025-01-09 09:42:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 686 transitions. [2025-01-09 09:42:09,478 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 686 transitions. Word has length 574 [2025-01-09 09:42:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:09,480 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 686 transitions. [2025-01-09 09:42:09,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 686 transitions. [2025-01-09 09:42:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 09:42:09,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:09,491 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:09,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:42:09,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:09,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -573083588, now seen corresponding path program 1 times [2025-01-09 09:42:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470139242] [2025-01-09 09:42:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:09,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 09:42:09,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 09:42:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470139242] [2025-01-09 09:42:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470139242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:42:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528076532] [2025-01-09 09:42:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:42:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:10,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:42:10,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:42:10,448 INFO L87 Difference]: Start difference. First operand 422 states and 686 transitions. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:12,391 INFO L93 Difference]: Finished difference Result 2964 states and 4767 transitions. [2025-01-09 09:42:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:42:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-01-09 09:42:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:12,406 INFO L225 Difference]: With dead ends: 2964 [2025-01-09 09:42:12,406 INFO L226 Difference]: Without dead ends: 2545 [2025-01-09 09:42:12,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:42:12,410 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 2209 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:12,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 2899 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 09:42:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2025-01-09 09:42:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1894. [2025-01-09 09:42:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1381 states have (on average 1.4902244750181028) internal successors, (2058), 1392 states have internal predecessors, (2058), 499 states have call successors, (499), 13 states have call predecessors, (499), 13 states have return successors, (499), 488 states have call predecessors, (499), 499 states have call successors, (499) [2025-01-09 09:42:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3056 transitions. [2025-01-09 09:42:12,611 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3056 transitions. Word has length 574 [2025-01-09 09:42:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:12,612 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3056 transitions. [2025-01-09 09:42:12,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3056 transitions. [2025-01-09 09:42:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 09:42:12,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:12,620 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:12,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:42:12,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:12,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -511043974, now seen corresponding path program 1 times [2025-01-09 09:42:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894100404] [2025-01-09 09:42:12,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:12,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 09:42:12,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 09:42:12,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:12,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894100404] [2025-01-09 09:42:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894100404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:12,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521024072] [2025-01-09 09:42:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:12,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:12,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:12,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:12,900 INFO L87 Difference]: Start difference. First operand 1894 states and 3056 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:13,096 INFO L93 Difference]: Finished difference Result 5676 states and 9162 transitions. [2025-01-09 09:42:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-01-09 09:42:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:13,121 INFO L225 Difference]: With dead ends: 5676 [2025-01-09 09:42:13,122 INFO L226 Difference]: Without dead ends: 3785 [2025-01-09 09:42:13,128 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 09:42:13,129 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 234 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:13,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 825 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2025-01-09 09:42:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3783. [2025-01-09 09:42:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3783 states, 2758 states have (on average 1.4865844815083393) internal successors, (4100), 2780 states have internal predecessors, (4100), 998 states have call successors, (998), 26 states have call predecessors, (998), 26 states have return successors, (998), 976 states have call predecessors, (998), 998 states have call successors, (998) [2025-01-09 09:42:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 6096 transitions. [2025-01-09 09:42:13,405 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 6096 transitions. Word has length 574 [2025-01-09 09:42:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:13,406 INFO L471 AbstractCegarLoop]: Abstraction has 3783 states and 6096 transitions. [2025-01-09 09:42:13,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 6096 transitions. [2025-01-09 09:42:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 09:42:13,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:13,418 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:13,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:42:13,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -645057480, now seen corresponding path program 1 times [2025-01-09 09:42:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988812620] [2025-01-09 09:42:13,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:13,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 09:42:13,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 09:42:13,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:13,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988812620] [2025-01-09 09:42:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988812620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:14,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:42:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833666813] [2025-01-09 09:42:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:14,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:42:14,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:14,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:42:14,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:42:14,386 INFO L87 Difference]: Start difference. First operand 3783 states and 6096 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:17,034 INFO L93 Difference]: Finished difference Result 14881 states and 23923 transitions. [2025-01-09 09:42:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:42:17,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-01-09 09:42:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:17,096 INFO L225 Difference]: With dead ends: 14881 [2025-01-09 09:42:17,097 INFO L226 Difference]: Without dead ends: 11101 [2025-01-09 09:42:17,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:42:17,113 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2805 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2805 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:17,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2805 Valid, 2359 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 09:42:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2025-01-09 09:42:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 9787. [2025-01-09 09:42:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9787 states, 7104 states have (on average 1.4802927927927927) internal successors, (10516), 7164 states have internal predecessors, (10516), 2614 states have call successors, (2614), 68 states have call predecessors, (2614), 68 states have return successors, (2614), 2554 states have call predecessors, (2614), 2614 states have call successors, (2614) [2025-01-09 09:42:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9787 states to 9787 states and 15744 transitions. [2025-01-09 09:42:17,844 INFO L78 Accepts]: Start accepts. Automaton has 9787 states and 15744 transitions. Word has length 574 [2025-01-09 09:42:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 9787 states and 15744 transitions. [2025-01-09 09:42:17,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9787 states and 15744 transitions. [2025-01-09 09:42:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 09:42:17,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:17,856 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:17,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:42:17,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash -967450374, now seen corresponding path program 1 times [2025-01-09 09:42:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369718045] [2025-01-09 09:42:17,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:17,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 09:42:18,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 09:42:18,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:18,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:18,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:18,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369718045] [2025-01-09 09:42:18,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369718045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:18,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:18,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:18,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943182960] [2025-01-09 09:42:18,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:18,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:18,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:18,294 INFO L87 Difference]: Start difference. First operand 9787 states and 15744 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:18,667 INFO L93 Difference]: Finished difference Result 19699 states and 31677 transitions. [2025-01-09 09:42:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-01-09 09:42:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:18,730 INFO L225 Difference]: With dead ends: 19699 [2025-01-09 09:42:18,730 INFO L226 Difference]: Without dead ends: 9915 [2025-01-09 09:42:18,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:18,755 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 0 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:18,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1228 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2025-01-09 09:42:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 9915. [2025-01-09 09:42:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9915 states, 7232 states have (on average 1.4717920353982301) internal successors, (10644), 7292 states have internal predecessors, (10644), 2614 states have call successors, (2614), 68 states have call predecessors, (2614), 68 states have return successors, (2614), 2554 states have call predecessors, (2614), 2614 states have call successors, (2614) [2025-01-09 09:42:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9915 states to 9915 states and 15872 transitions. [2025-01-09 09:42:19,335 INFO L78 Accepts]: Start accepts. Automaton has 9915 states and 15872 transitions. Word has length 574 [2025-01-09 09:42:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 9915 states and 15872 transitions. [2025-01-09 09:42:19,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9915 states and 15872 transitions. [2025-01-09 09:42:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:19,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:19,350 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:42:19,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash -450972275, now seen corresponding path program 1 times [2025-01-09 09:42:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571695338] [2025-01-09 09:42:19,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:19,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:19,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:19,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:19,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571695338] [2025-01-09 09:42:19,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571695338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:19,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:42:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341485060] [2025-01-09 09:42:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:19,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:42:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:19,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:42:19,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:19,785 INFO L87 Difference]: Start difference. First operand 9915 states and 15872 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:21,147 INFO L93 Difference]: Finished difference Result 30569 states and 48676 transitions. [2025-01-09 09:42:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:42:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-01-09 09:42:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:21,232 INFO L225 Difference]: With dead ends: 30569 [2025-01-09 09:42:21,232 INFO L226 Difference]: Without dead ends: 20657 [2025-01-09 09:42:21,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:42:21,257 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 522 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:21,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 2181 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:42:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20657 states. [2025-01-09 09:42:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20657 to 6295. [2025-01-09 09:42:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6295 states, 4572 states have (on average 1.47331583552056) internal successors, (6736), 4600 states have internal predecessors, (6736), 1654 states have call successors, (1654), 68 states have call predecessors, (1654), 68 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 09:42:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 10044 transitions. [2025-01-09 09:42:21,921 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 10044 transitions. Word has length 576 [2025-01-09 09:42:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:21,924 INFO L471 AbstractCegarLoop]: Abstraction has 6295 states and 10044 transitions. [2025-01-09 09:42:21,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 10044 transitions. [2025-01-09 09:42:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:21,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:21,930 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:21,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:42:21,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:21,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1268620725, now seen corresponding path program 1 times [2025-01-09 09:42:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:21,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847302199] [2025-01-09 09:42:21,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:21,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:22,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:22,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:22,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:22,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847302199] [2025-01-09 09:42:22,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847302199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:22,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:22,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784454930] [2025-01-09 09:42:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:22,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:22,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:22,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:22,367 INFO L87 Difference]: Start difference. First operand 6295 states and 10044 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:23,460 INFO L93 Difference]: Finished difference Result 17939 states and 28619 transitions. [2025-01-09 09:42:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-01-09 09:42:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:23,517 INFO L225 Difference]: With dead ends: 17939 [2025-01-09 09:42:23,517 INFO L226 Difference]: Without dead ends: 11647 [2025-01-09 09:42:23,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 09:42:23,540 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 591 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:23,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1060 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:42:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11647 states. [2025-01-09 09:42:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11647 to 8075. [2025-01-09 09:42:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8075 states, 6352 states have (on average 1.5207808564231737) internal successors, (9660), 6380 states have internal predecessors, (9660), 1654 states have call successors, (1654), 68 states have call predecessors, (1654), 68 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 09:42:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8075 states to 8075 states and 12968 transitions. [2025-01-09 09:42:24,196 INFO L78 Accepts]: Start accepts. Automaton has 8075 states and 12968 transitions. Word has length 576 [2025-01-09 09:42:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 8075 states and 12968 transitions. [2025-01-09 09:42:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 12968 transitions. [2025-01-09 09:42:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:24,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:24,205 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:24,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:42:24,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:24,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1220908237, now seen corresponding path program 1 times [2025-01-09 09:42:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919379594] [2025-01-09 09:42:24,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:24,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:24,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:24,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:24,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 96 proven. 177 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:24,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919379594] [2025-01-09 09:42:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919379594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133548833] [2025-01-09 09:42:24,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:24,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:24,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:24,766 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 09:42:24,767 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 09:42:24,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:25,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:25,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:42:25,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7707 proven. 177 refuted. 0 times theorem prover too weak. 8860 trivial. 0 not checked. [2025-01-09 09:42:25,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 96 proven. 177 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133548833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:26,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-01-09 09:42:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559660399] [2025-01-09 09:42:26,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:42:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:26,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:42:26,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:42:26,032 INFO L87 Difference]: Start difference. First operand 8075 states and 12968 transitions. Second operand has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 3 states have call successors, (210), 2 states have call predecessors, (210), 4 states have return successors, (211), 3 states have call predecessors, (211), 3 states have call successors, (211) [2025-01-09 09:42:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:27,384 INFO L93 Difference]: Finished difference Result 21533 states and 34346 transitions. [2025-01-09 09:42:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:42:27,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 3 states have call successors, (210), 2 states have call predecessors, (210), 4 states have return successors, (211), 3 states have call predecessors, (211), 3 states have call successors, (211) Word has length 576 [2025-01-09 09:42:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:27,438 INFO L225 Difference]: With dead ends: 21533 [2025-01-09 09:42:27,438 INFO L226 Difference]: Without dead ends: 13453 [2025-01-09 09:42:27,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1147 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:42:27,461 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 774 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:27,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1337 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:42:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13453 states. [2025-01-09 09:42:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13453 to 8231. [2025-01-09 09:42:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8231 states, 6476 states have (on average 1.5114268066707843) internal successors, (9788), 6504 states have internal predecessors, (9788), 1654 states have call successors, (1654), 100 states have call predecessors, (1654), 100 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 09:42:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8231 states to 8231 states and 13096 transitions. [2025-01-09 09:42:28,086 INFO L78 Accepts]: Start accepts. Automaton has 8231 states and 13096 transitions. Word has length 576 [2025-01-09 09:42:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:28,086 INFO L471 AbstractCegarLoop]: Abstraction has 8231 states and 13096 transitions. [2025-01-09 09:42:28,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 3 states have call successors, (210), 2 states have call predecessors, (210), 4 states have return successors, (211), 3 states have call predecessors, (211), 3 states have call successors, (211) [2025-01-09 09:42:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8231 states and 13096 transitions. [2025-01-09 09:42:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:28,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:28,095 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:28,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:42:28,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:28,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:28,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1885894189, now seen corresponding path program 1 times [2025-01-09 09:42:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398827670] [2025-01-09 09:42:28,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:28,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398827670] [2025-01-09 09:42:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398827670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:28,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:42:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396300692] [2025-01-09 09:42:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:42:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:28,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:42:28,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:28,601 INFO L87 Difference]: Start difference. First operand 8231 states and 13096 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:29,922 INFO L93 Difference]: Finished difference Result 21680 states and 34400 transitions. [2025-01-09 09:42:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:42:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-01-09 09:42:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:29,989 INFO L225 Difference]: With dead ends: 21680 [2025-01-09 09:42:29,989 INFO L226 Difference]: Without dead ends: 17453 [2025-01-09 09:42:30,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:30,006 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 394 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:30,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1776 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:42:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17453 states. [2025-01-09 09:42:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17453 to 7903. [2025-01-09 09:42:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7903 states, 6148 states have (on average 1.5035783994795056) internal successors, (9244), 6176 states have internal predecessors, (9244), 1654 states have call successors, (1654), 100 states have call predecessors, (1654), 100 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 09:42:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7903 states to 7903 states and 12552 transitions. [2025-01-09 09:42:30,691 INFO L78 Accepts]: Start accepts. Automaton has 7903 states and 12552 transitions. Word has length 576 [2025-01-09 09:42:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:30,692 INFO L471 AbstractCegarLoop]: Abstraction has 7903 states and 12552 transitions. [2025-01-09 09:42:30,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7903 states and 12552 transitions. [2025-01-09 09:42:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:30,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:30,701 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:42:30,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1591424657, now seen corresponding path program 1 times [2025-01-09 09:42:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528327324] [2025-01-09 09:42:30,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:30,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:30,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:30,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:30,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528327324] [2025-01-09 09:42:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528327324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:31,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:42:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633489977] [2025-01-09 09:42:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:42:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:31,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:42:31,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:31,030 INFO L87 Difference]: Start difference. First operand 7903 states and 12552 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:32,431 INFO L93 Difference]: Finished difference Result 15428 states and 24447 transitions. [2025-01-09 09:42:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:42:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-01-09 09:42:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:32,477 INFO L225 Difference]: With dead ends: 15428 [2025-01-09 09:42:32,477 INFO L226 Difference]: Without dead ends: 11365 [2025-01-09 09:42:32,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:42:32,490 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 516 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:32,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2387 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:42:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2025-01-09 09:42:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 7705. [2025-01-09 09:42:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7705 states, 5950 states have (on average 1.494453781512605) internal successors, (8892), 5978 states have internal predecessors, (8892), 1654 states have call successors, (1654), 100 states have call predecessors, (1654), 100 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 09:42:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7705 states to 7705 states and 12200 transitions. [2025-01-09 09:42:33,136 INFO L78 Accepts]: Start accepts. Automaton has 7705 states and 12200 transitions. Word has length 576 [2025-01-09 09:42:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:33,137 INFO L471 AbstractCegarLoop]: Abstraction has 7705 states and 12200 transitions. [2025-01-09 09:42:33,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7705 states and 12200 transitions. [2025-01-09 09:42:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:33,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:33,145 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:33,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:42:33,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:33,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1957868081, now seen corresponding path program 1 times [2025-01-09 09:42:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:33,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635010482] [2025-01-09 09:42:33,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:33,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:33,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:33,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:33,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:42:33,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:33,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635010482] [2025-01-09 09:42:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635010482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:42:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915852218] [2025-01-09 09:42:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:33,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:42:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:33,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:42:33,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:33,771 INFO L87 Difference]: Start difference. First operand 7705 states and 12200 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:35,203 INFO L93 Difference]: Finished difference Result 17183 states and 27208 transitions. [2025-01-09 09:42:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:42:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-01-09 09:42:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:35,238 INFO L225 Difference]: With dead ends: 17183 [2025-01-09 09:42:35,238 INFO L226 Difference]: Without dead ends: 9481 [2025-01-09 09:42:35,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:42:35,255 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 1006 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:35,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1658 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:42:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2025-01-09 09:42:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 7595. [2025-01-09 09:42:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7595 states, 5840 states have (on average 1.4876712328767123) internal successors, (8688), 5868 states have internal predecessors, (8688), 1654 states have call successors, (1654), 100 states have call predecessors, (1654), 100 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 09:42:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 11996 transitions. [2025-01-09 09:42:35,957 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 11996 transitions. Word has length 576 [2025-01-09 09:42:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 7595 states and 11996 transitions. [2025-01-09 09:42:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:42:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 11996 transitions. [2025-01-09 09:42:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:35,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:35,965 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:42:35,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 562065359, now seen corresponding path program 1 times [2025-01-09 09:42:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027008799] [2025-01-09 09:42:35,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:35,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:36,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027008799] [2025-01-09 09:42:36,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027008799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349219181] [2025-01-09 09:42:36,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:36,565 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 09:42:36,569 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 09:42:36,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:36,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 09:42:36,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8307 proven. 117 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 09:42:37,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349219181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:37,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:37,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-09 09:42:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919043993] [2025-01-09 09:42:37,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:37,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:42:37,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:37,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:42:37,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:42:37,610 INFO L87 Difference]: Start difference. First operand 7595 states and 11996 transitions. Second operand has 14 states, 14 states have (on average 10.5) internal successors, (147), 14 states have internal predecessors, (147), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-01-09 09:42:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:39,613 INFO L93 Difference]: Finished difference Result 15659 states and 24546 transitions. [2025-01-09 09:42:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 09:42:39,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.5) internal successors, (147), 14 states have internal predecessors, (147), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) Word has length 576 [2025-01-09 09:42:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:39,650 INFO L225 Difference]: With dead ends: 15659 [2025-01-09 09:42:39,650 INFO L226 Difference]: Without dead ends: 11750 [2025-01-09 09:42:39,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1147 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-01-09 09:42:39,660 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 869 mSDsluCounter, 2991 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:39,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 3392 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:42:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11750 states. [2025-01-09 09:42:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11750 to 8437. [2025-01-09 09:42:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8437 states, 6652 states have (on average 1.4882742032471437) internal successors, (9900), 6680 states have internal predecessors, (9900), 1672 states have call successors, (1672), 112 states have call predecessors, (1672), 112 states have return successors, (1672), 1644 states have call predecessors, (1672), 1672 states have call successors, (1672) [2025-01-09 09:42:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13244 transitions. [2025-01-09 09:42:40,466 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13244 transitions. Word has length 576 [2025-01-09 09:42:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:40,467 INFO L471 AbstractCegarLoop]: Abstraction has 8437 states and 13244 transitions. [2025-01-09 09:42:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.5) internal successors, (147), 14 states have internal predecessors, (147), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-01-09 09:42:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13244 transitions. [2025-01-09 09:42:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:40,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:40,474 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:40,481 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 09:42:40,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:40,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1307739917, now seen corresponding path program 1 times [2025-01-09 09:42:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426713044] [2025-01-09 09:42:40,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:40,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:40,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:40,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:41,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426713044] [2025-01-09 09:42:41,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426713044] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11691919] [2025-01-09 09:42:41,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:41,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:41,413 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 09:42:41,416 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 09:42:41,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:41,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:41,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:41,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:41,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 09:42:41,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8307 proven. 117 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 09:42:42,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11691919] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:43,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 10] total 26 [2025-01-09 09:42:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925826568] [2025-01-09 09:42:43,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:43,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 09:42:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:43,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 09:42:43,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:42:43,402 INFO L87 Difference]: Start difference. First operand 8437 states and 13244 transitions. Second operand has 26 states, 25 states have (on average 11.2) internal successors, (280), 26 states have internal predecessors, (280), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 6 states have call successors, (276) [2025-01-09 09:42:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:48,268 INFO L93 Difference]: Finished difference Result 24317 states and 38165 transitions. [2025-01-09 09:42:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 09:42:48,268 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 11.2) internal successors, (280), 26 states have internal predecessors, (280), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 6 states have call successors, (276) Word has length 576 [2025-01-09 09:42:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:48,318 INFO L225 Difference]: With dead ends: 24317 [2025-01-09 09:42:48,318 INFO L226 Difference]: Without dead ends: 15883 [2025-01-09 09:42:48,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1144 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=2102, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 09:42:48,334 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 2370 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 5113 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2566 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 6862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 5113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:48,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2566 Valid, 5269 Invalid, 6862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 5113 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 09:42:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2025-01-09 09:42:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 9746. [2025-01-09 09:42:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 7337 states have (on average 1.4707646176911544) internal successors, (10791), 7377 states have internal predecessors, (10791), 2252 states have call successors, (2252), 156 states have call predecessors, (2252), 156 states have return successors, (2252), 2212 states have call predecessors, (2252), 2252 states have call successors, (2252) [2025-01-09 09:42:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 15295 transitions. [2025-01-09 09:42:49,329 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 15295 transitions. Word has length 576 [2025-01-09 09:42:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:49,330 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 15295 transitions. [2025-01-09 09:42:49,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 11.2) internal successors, (280), 26 states have internal predecessors, (280), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 6 states have call successors, (276) [2025-01-09 09:42:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 15295 transitions. [2025-01-09 09:42:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:49,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:49,337 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:49,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:42:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:49,537 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -11741427, now seen corresponding path program 1 times [2025-01-09 09:42:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505098750] [2025-01-09 09:42:49,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:49,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:49,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:49,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:49,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505098750] [2025-01-09 09:42:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505098750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515123092] [2025-01-09 09:42:50,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:50,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:50,112 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 09:42:50,115 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 09:42:50,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:50,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:50,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:50,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:42:50,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7407 proven. 87 refuted. 0 times theorem prover too weak. 9250 trivial. 0 not checked. [2025-01-09 09:42:50,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 186 proven. 87 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515123092] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:50,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-01-09 09:42:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395562932] [2025-01-09 09:42:50,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:42:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:50,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:42:50,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:42:50,894 INFO L87 Difference]: Start difference. First operand 9746 states and 15295 transitions. Second operand has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) [2025-01-09 09:42:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:55,810 INFO L93 Difference]: Finished difference Result 35941 states and 56013 transitions. [2025-01-09 09:42:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 09:42:55,811 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) Word has length 576 [2025-01-09 09:42:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:55,881 INFO L225 Difference]: With dead ends: 35941 [2025-01-09 09:42:55,881 INFO L226 Difference]: Without dead ends: 26198 [2025-01-09 09:42:55,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1150 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=584, Invalid=1866, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 09:42:55,903 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 2140 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 2640 mSolverCounterSat, 1407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1407 IncrementalHoareTripleChecker+Valid, 2640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:55,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2141 Valid, 2340 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1407 Valid, 2640 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:42:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26198 states. [2025-01-09 09:42:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26198 to 9185. [2025-01-09 09:42:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9185 states, 7432 states have (on average 1.5107642626480087) internal successors, (11228), 7460 states have internal predecessors, (11228), 1636 states have call successors, (1636), 116 states have call predecessors, (1636), 116 states have return successors, (1636), 1608 states have call predecessors, (1636), 1636 states have call successors, (1636) [2025-01-09 09:42:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 14500 transitions. [2025-01-09 09:42:57,008 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 14500 transitions. Word has length 576 [2025-01-09 09:42:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:57,009 INFO L471 AbstractCegarLoop]: Abstraction has 9185 states and 14500 transitions. [2025-01-09 09:42:57,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) [2025-01-09 09:42:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 14500 transitions. [2025-01-09 09:42:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 09:42:57,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:57,016 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:57,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 09:42:57,216 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,SelfDestructingSolverStorable14 [2025-01-09 09:42:57,216 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:57,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1041100725, now seen corresponding path program 1 times [2025-01-09 09:42:57,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168915802] [2025-01-09 09:42:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:57,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:57,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:57,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:57,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168915802] [2025-01-09 09:42:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168915802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429217239] [2025-01-09 09:42:57,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:57,531 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 09:42:57,533 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 09:42:57,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 09:42:57,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 09:42:57,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:57,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:57,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:42:57,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7761 proven. 96 refuted. 0 times theorem prover too weak. 8887 trivial. 0 not checked. [2025-01-09 09:42:58,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:42:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429217239] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:58,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-01-09 09:42:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826460773] [2025-01-09 09:42:58,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:58,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:42:58,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:58,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:42:58,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:42:58,925 INFO L87 Difference]: Start difference. First operand 9185 states and 14500 transitions. Second operand has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) [2025-01-09 09:43:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:00,705 INFO L93 Difference]: Finished difference Result 21859 states and 34563 transitions. [2025-01-09 09:43:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:43:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) Word has length 576 [2025-01-09 09:43:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:00,741 INFO L225 Difference]: With dead ends: 21859 [2025-01-09 09:43:00,741 INFO L226 Difference]: Without dead ends: 12677 [2025-01-09 09:43:00,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1143 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-01-09 09:43:00,758 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1241 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:00,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 2459 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:43:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12677 states. [2025-01-09 09:43:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12677 to 8585. [2025-01-09 09:43:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8585 states, 6832 states have (on average 1.4988290398126465) internal successors, (10240), 6860 states have internal predecessors, (10240), 1636 states have call successors, (1636), 116 states have call predecessors, (1636), 116 states have return successors, (1636), 1608 states have call predecessors, (1636), 1636 states have call successors, (1636) [2025-01-09 09:43:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8585 states to 8585 states and 13512 transitions. [2025-01-09 09:43:01,505 INFO L78 Accepts]: Start accepts. Automaton has 8585 states and 13512 transitions. Word has length 576 [2025-01-09 09:43:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:01,506 INFO L471 AbstractCegarLoop]: Abstraction has 8585 states and 13512 transitions. [2025-01-09 09:43:01,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) [2025-01-09 09:43:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8585 states and 13512 transitions. [2025-01-09 09:43:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 09:43:01,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:01,512 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:01,520 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 09:43:01,712 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,SelfDestructingSolverStorable15 [2025-01-09 09:43:01,713 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:01,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1382099223, now seen corresponding path program 1 times [2025-01-09 09:43:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775509385] [2025-01-09 09:43:01,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:01,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:43:01,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:43:01,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:01,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:43:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775509385] [2025-01-09 09:43:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775509385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:43:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957759637] [2025-01-09 09:43:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:43:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:02,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:43:02,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:43:02,366 INFO L87 Difference]: Start difference. First operand 8585 states and 13512 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:43:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:08,030 INFO L93 Difference]: Finished difference Result 46813 states and 73551 transitions. [2025-01-09 09:43:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:43:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 577 [2025-01-09 09:43:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:08,122 INFO L225 Difference]: With dead ends: 46813 [2025-01-09 09:43:08,123 INFO L226 Difference]: Without dead ends: 42389 [2025-01-09 09:43:08,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:43:08,151 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1731 mSDsluCounter, 3002 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 3822 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:08,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 3822 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 09:43:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42389 states. [2025-01-09 09:43:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42389 to 15185. [2025-01-09 09:43:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15185 states, 11648 states have (on average 1.4752747252747254) internal successors, (17184), 11708 states have internal predecessors, (17184), 3272 states have call successors, (3272), 264 states have call predecessors, (3272), 264 states have return successors, (3272), 3212 states have call predecessors, (3272), 3272 states have call successors, (3272) [2025-01-09 09:43:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15185 states to 15185 states and 23728 transitions. [2025-01-09 09:43:10,320 INFO L78 Accepts]: Start accepts. Automaton has 15185 states and 23728 transitions. Word has length 577 [2025-01-09 09:43:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:10,321 INFO L471 AbstractCegarLoop]: Abstraction has 15185 states and 23728 transitions. [2025-01-09 09:43:10,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 09:43:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15185 states and 23728 transitions. [2025-01-09 09:43:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 09:43:10,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:10,335 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 09:43:10,336 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1225267216, now seen corresponding path program 1 times [2025-01-09 09:43:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613409549] [2025-01-09 09:43:10,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:10,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:43:10,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:43:10,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:10,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 189 proven. 84 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:43:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613409549] [2025-01-09 09:43:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613409549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:43:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926664700] [2025-01-09 09:43:10,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:10,641 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 09:43:10,643 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 09:43:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:43:10,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:43:10,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:10,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:10,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:43:10,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:43:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7273 proven. 84 refuted. 0 times theorem prover too weak. 9387 trivial. 0 not checked. [2025-01-09 09:43:11,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:43:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 189 proven. 84 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 09:43:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926664700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:43:11,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:43:11,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 09:43:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161867774] [2025-01-09 09:43:11,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:43:11,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:43:11,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:11,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:43:11,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:43:11,290 INFO L87 Difference]: Start difference. First operand 15185 states and 23728 transitions. Second operand has 11 states, 11 states have (on average 16.636363636363637) internal successors, (183), 11 states have internal predecessors, (183), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) [2025-01-09 09:43:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:12,423 INFO L93 Difference]: Finished difference Result 15399 states and 23973 transitions. [2025-01-09 09:43:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:43:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.636363636363637) internal successors, (183), 11 states have internal predecessors, (183), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) Word has length 577 [2025-01-09 09:43:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:12,450 INFO L225 Difference]: With dead ends: 15399 [2025-01-09 09:43:12,450 INFO L226 Difference]: Without dead ends: 7623 [2025-01-09 09:43:12,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1149 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:43:12,460 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 418 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:12,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1376 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:43:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2025-01-09 09:43:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 6797. [2025-01-09 09:43:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6797 states, 5024 states have (on average 1.4311305732484076) internal successors, (7190), 5054 states have internal predecessors, (7190), 1636 states have call successors, (1636), 136 states have call predecessors, (1636), 136 states have return successors, (1636), 1606 states have call predecessors, (1636), 1636 states have call successors, (1636) [2025-01-09 09:43:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6797 states to 6797 states and 10462 transitions. [2025-01-09 09:43:13,287 INFO L78 Accepts]: Start accepts. Automaton has 6797 states and 10462 transitions. Word has length 577 [2025-01-09 09:43:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:13,288 INFO L471 AbstractCegarLoop]: Abstraction has 6797 states and 10462 transitions. [2025-01-09 09:43:13,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.636363636363637) internal successors, (183), 11 states have internal predecessors, (183), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) [2025-01-09 09:43:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6797 states and 10462 transitions. [2025-01-09 09:43:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 09:43:13,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:13,294 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:13,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 09:43:13,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 09:43:13,495 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:13,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -479592658, now seen corresponding path program 1 times [2025-01-09 09:43:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319101612] [2025-01-09 09:43:13,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:43:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:43:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 540 proven. 516 refuted. 0 times theorem prover too weak. 15688 trivial. 0 not checked. [2025-01-09 09:43:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319101612] [2025-01-09 09:43:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319101612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:43:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265854142] [2025-01-09 09:43:15,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:15,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:15,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:43:15,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 09:43:15,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:43:16,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:43:16,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:16,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:16,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 09:43:16,106 INFO L279 TraceCheckSpWp]: Computing forward predicates...