./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.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 569b7b70ffce685c43ef1e1873a16a7ab7979c99918cf4e931b631a44259c89c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:30:28,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:30:28,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:30:28,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:30:28,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:30:28,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:30:28,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:30:28,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:30:28,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:30:28,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:30:28,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:30:28,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:30:28,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:30:28,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:30:28,178 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:30:28,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:30:28,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:30:28,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:30:28,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:28,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:28,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:28,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:28,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:28,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:30:28,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:30:28,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:30:28,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:30:28,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:30:28,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:30:28,182 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 -> 569b7b70ffce685c43ef1e1873a16a7ab7979c99918cf4e931b631a44259c89c [2025-01-09 14:30:28,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:30:28,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:30:28,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:30:28,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:30:28,397 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:30:28,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.i [2025-01-09 14:30:29,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b178ca8a/9e187e168f13413383cd93b458937ed6/FLAG98fad9f49 [2025-01-09 14:30:29,876 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:30:29,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.i [2025-01-09 14:30:29,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b178ca8a/9e187e168f13413383cd93b458937ed6/FLAG98fad9f49 [2025-01-09 14:30:30,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b178ca8a/9e187e168f13413383cd93b458937ed6 [2025-01-09 14:30:30,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:30:30,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:30:30,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:30,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:30:30,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:30:30,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bdbc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30, skipping insertion in model container [2025-01-09 14:30:30,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:30:30,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.i[916,929] [2025-01-09 14:30:30,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:30,354 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:30:30,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.i[916,929] [2025-01-09 14:30:30,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:30,436 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:30:30,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30 WrapperNode [2025-01-09 14:30:30,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:30,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:30,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:30:30,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:30:30,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,515 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-01-09 14:30:30,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:30,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:30:30,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:30:30,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:30:30,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,553 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:30:30,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:30:30,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:30:30,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:30:30,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:30:30,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (1/1) ... [2025-01-09 14:30:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:30,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:30,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:30:30,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:30:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:30:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:30:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:30:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:30:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:30:30,781 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:30:30,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:30:31,322 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-01-09 14:30:31,323 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:30:31,329 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:30:31,330 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:30:31,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:31 BoogieIcfgContainer [2025-01-09 14:30:31,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:30:31,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:30:31,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:30:31,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:30:31,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:30:30" (1/3) ... [2025-01-09 14:30:31,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742082ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:31, skipping insertion in model container [2025-01-09 14:30:31,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:30" (2/3) ... [2025-01-09 14:30:31,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742082ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:31, skipping insertion in model container [2025-01-09 14:30:31,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:31" (3/3) ... [2025-01-09 14:30:31,336 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-96.i [2025-01-09 14:30:31,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:30:31,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-96.i that has 2 procedures, 178 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:30:31,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:30:31,384 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;@2e1fcf02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:30:31,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:30:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 137 states have (on average 1.510948905109489) internal successors, (207), 138 states have internal predecessors, (207), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:30:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 14:30:31,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:31,399 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:31,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1850913932, now seen corresponding path program 1 times [2025-01-09 14:30:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425690675] [2025-01-09 14:30:31,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:31,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 14:30:31,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 14:30:31,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:31,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-01-09 14:30:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425690675] [2025-01-09 14:30:31,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425690675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365995596] [2025-01-09 14:30:31,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:31,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:31,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:31,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:30:31,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 14:30:31,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 14:30:31,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:31,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:31,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:30:31,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-01-09 14:30:32,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365995596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:32,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:30:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088808180] [2025-01-09 14:30:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:32,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:30:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:32,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:30:32,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:30:32,034 INFO L87 Difference]: Start difference. First operand has 178 states, 137 states have (on average 1.510948905109489) internal successors, (207), 138 states have internal predecessors, (207), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 14:30:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:32,071 INFO L93 Difference]: Finished difference Result 350 states and 599 transitions. [2025-01-09 14:30:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:30:32,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 273 [2025-01-09 14:30:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:32,077 INFO L225 Difference]: With dead ends: 350 [2025-01-09 14:30:32,077 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 14:30:32,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:30:32,082 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:32,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 14:30:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-09 14:30:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:30:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 276 transitions. [2025-01-09 14:30:32,133 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 276 transitions. Word has length 273 [2025-01-09 14:30:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:32,134 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 276 transitions. [2025-01-09 14:30:32,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 14:30:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 276 transitions. [2025-01-09 14:30:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 14:30:32,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:32,140 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:32,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:30:32,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:30:32,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:32,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1519382852, now seen corresponding path program 1 times [2025-01-09 14:30:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005716294] [2025-01-09 14:30:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:32,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 14:30:32,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 14:30:32,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005716294] [2025-01-09 14:30:32,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005716294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:32,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:32,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010172126] [2025-01-09 14:30:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:32,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:32,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:32,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:32,678 INFO L87 Difference]: Start difference. First operand 175 states and 276 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:32,800 INFO L93 Difference]: Finished difference Result 507 states and 802 transitions. [2025-01-09 14:30:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 273 [2025-01-09 14:30:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:32,806 INFO L225 Difference]: With dead ends: 507 [2025-01-09 14:30:32,807 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 14:30:32,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:32,809 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 245 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:32,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 518 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 14:30:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 241. [2025-01-09 14:30:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 201 states have (on average 1.507462686567164) internal successors, (303), 201 states have internal predecessors, (303), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 14:30:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 379 transitions. [2025-01-09 14:30:32,839 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 379 transitions. Word has length 273 [2025-01-09 14:30:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:32,841 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 379 transitions. [2025-01-09 14:30:32,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 379 transitions. [2025-01-09 14:30:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 14:30:32,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:32,844 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:32,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:30:32,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1913749638, now seen corresponding path program 1 times [2025-01-09 14:30:32,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:32,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713489259] [2025-01-09 14:30:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:32,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 14:30:32,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 14:30:32,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713489259] [2025-01-09 14:30:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713489259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:33,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648275535] [2025-01-09 14:30:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:33,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:33,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:33,331 INFO L87 Difference]: Start difference. First operand 241 states and 379 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:33,412 INFO L93 Difference]: Finished difference Result 717 states and 1131 transitions. [2025-01-09 14:30:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 273 [2025-01-09 14:30:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:33,415 INFO L225 Difference]: With dead ends: 717 [2025-01-09 14:30:33,415 INFO L226 Difference]: Without dead ends: 479 [2025-01-09 14:30:33,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:33,416 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 262 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:33,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 503 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-09 14:30:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2025-01-09 14:30:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 398 states have (on average 1.5050251256281406) internal successors, (599), 398 states have internal predecessors, (599), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:30:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 751 transitions. [2025-01-09 14:30:33,445 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 751 transitions. Word has length 273 [2025-01-09 14:30:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:33,446 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 751 transitions. [2025-01-09 14:30:33,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 751 transitions. [2025-01-09 14:30:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-01-09 14:30:33,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:33,449 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:30:33,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1557594440, now seen corresponding path program 1 times [2025-01-09 14:30:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691943028] [2025-01-09 14:30:33,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:33,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 14:30:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 14:30:33,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:33,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691943028] [2025-01-09 14:30:33,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691943028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:33,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:33,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929660942] [2025-01-09 14:30:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:33,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:33,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:33,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:33,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:33,760 INFO L87 Difference]: Start difference. First operand 477 states and 751 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:33,846 INFO L93 Difference]: Finished difference Result 1032 states and 1626 transitions. [2025-01-09 14:30:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:33,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-01-09 14:30:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:33,852 INFO L225 Difference]: With dead ends: 1032 [2025-01-09 14:30:33,852 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 14:30:33,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:33,853 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 240 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:33,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 503 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 14:30:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 477. [2025-01-09 14:30:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 398 states have (on average 1.484924623115578) internal successors, (591), 398 states have internal predecessors, (591), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:30:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 743 transitions. [2025-01-09 14:30:33,909 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 743 transitions. Word has length 274 [2025-01-09 14:30:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:33,910 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 743 transitions. [2025-01-09 14:30:33,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 743 transitions. [2025-01-09 14:30:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 14:30:33,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:33,913 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:33,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:30:33,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1773346972, now seen corresponding path program 1 times [2025-01-09 14:30:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287204679] [2025-01-09 14:30:33,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:33,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 14:30:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 14:30:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287204679] [2025-01-09 14:30:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287204679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146536220] [2025-01-09 14:30:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:34,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:34,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:34,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:34,259 INFO L87 Difference]: Start difference. First operand 477 states and 743 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:34,436 INFO L93 Difference]: Finished difference Result 1333 states and 2073 transitions. [2025-01-09 14:30:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 275 [2025-01-09 14:30:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:34,443 INFO L225 Difference]: With dead ends: 1333 [2025-01-09 14:30:34,443 INFO L226 Difference]: Without dead ends: 859 [2025-01-09 14:30:34,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:30:34,444 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 192 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:34,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 810 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-01-09 14:30:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 855. [2025-01-09 14:30:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 746 states have (on average 1.5013404825737264) internal successors, (1120), 748 states have internal predecessors, (1120), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 14:30:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1328 transitions. [2025-01-09 14:30:34,497 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1328 transitions. Word has length 275 [2025-01-09 14:30:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:34,498 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1328 transitions. [2025-01-09 14:30:34,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1328 transitions. [2025-01-09 14:30:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 14:30:34,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:34,504 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:30:34,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:34,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash 165815074, now seen corresponding path program 1 times [2025-01-09 14:30:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467387323] [2025-01-09 14:30:34,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 14:30:34,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 14:30:34,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:34,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:30:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:35,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467387323] [2025-01-09 14:30:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467387323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186156043] [2025-01-09 14:30:35,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:35,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:35,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:35,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:35,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:30:35,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 14:30:35,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 14:30:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:35,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 14:30:35,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:35,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:35,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186156043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:35,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:35,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 14:30:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281730458] [2025-01-09 14:30:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:30:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:35,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:30:35,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:30:35,765 INFO L87 Difference]: Start difference. First operand 855 states and 1328 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:36,139 INFO L93 Difference]: Finished difference Result 2455 states and 3818 transitions. [2025-01-09 14:30:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:30:36,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 275 [2025-01-09 14:30:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:36,153 INFO L225 Difference]: With dead ends: 2455 [2025-01-09 14:30:36,153 INFO L226 Difference]: Without dead ends: 1603 [2025-01-09 14:30:36,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:30:36,160 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 234 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:36,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 707 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-01-09 14:30:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1183. [2025-01-09 14:30:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1074 states have (on average 1.5270018621973929) internal successors, (1640), 1076 states have internal predecessors, (1640), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 14:30:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1848 transitions. [2025-01-09 14:30:36,232 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1848 transitions. Word has length 275 [2025-01-09 14:30:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:36,232 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1848 transitions. [2025-01-09 14:30:36,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1848 transitions. [2025-01-09 14:30:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:36,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:36,236 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:36,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:30:36,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:36,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:36,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash -201660187, now seen corresponding path program 1 times [2025-01-09 14:30:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:36,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767218376] [2025-01-09 14:30:36,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:36,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:36,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:36,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:30:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767218376] [2025-01-09 14:30:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767218376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569236023] [2025-01-09 14:30:38,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:38,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:38,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:30:38,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:38,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:38,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:38,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:38,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 14:30:38,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:38,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:38,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569236023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 14:30:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409330234] [2025-01-09 14:30:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:30:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:38,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:30:38,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:30:38,515 INFO L87 Difference]: Start difference. First operand 1183 states and 1848 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:38,834 INFO L93 Difference]: Finished difference Result 2791 states and 4342 transitions. [2025-01-09 14:30:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:30:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 276 [2025-01-09 14:30:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:38,841 INFO L225 Difference]: With dead ends: 2791 [2025-01-09 14:30:38,841 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 14:30:38,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:30:38,844 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 226 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:38,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 831 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 14:30:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1191. [2025-01-09 14:30:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1082 states have (on average 1.5304990757855823) internal successors, (1656), 1084 states have internal predecessors, (1656), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 14:30:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1864 transitions. [2025-01-09 14:30:38,891 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1864 transitions. Word has length 276 [2025-01-09 14:30:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:38,892 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1864 transitions. [2025-01-09 14:30:38,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1864 transitions. [2025-01-09 14:30:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:38,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:38,895 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:38,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:30:39,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:39,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:39,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 347504469, now seen corresponding path program 1 times [2025-01-09 14:30:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474272537] [2025-01-09 14:30:39,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:39,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:39,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:39,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:39,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 108 proven. 3 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:30:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474272537] [2025-01-09 14:30:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474272537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270853784] [2025-01-09 14:30:39,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:39,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:39,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:39,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:30:39,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:39,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:39,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:30:39,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-01-09 14:30:39,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:39,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270853784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:39,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:39,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-01-09 14:30:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304248287] [2025-01-09 14:30:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:39,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:30:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:39,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:30:39,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:30:39,936 INFO L87 Difference]: Start difference. First operand 1191 states and 1864 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 14:30:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:40,472 INFO L93 Difference]: Finished difference Result 2126 states and 3320 transitions. [2025-01-09 14:30:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:30:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) Word has length 276 [2025-01-09 14:30:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:40,477 INFO L225 Difference]: With dead ends: 2126 [2025-01-09 14:30:40,477 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 14:30:40,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:30:40,479 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 368 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:40,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 951 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:30:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 14:30:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 906. [2025-01-09 14:30:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 755 states have (on average 1.447682119205298) internal successors, (1093), 758 states have internal predecessors, (1093), 141 states have call successors, (141), 9 states have call predecessors, (141), 9 states have return successors, (141), 138 states have call predecessors, (141), 141 states have call successors, (141) [2025-01-09 14:30:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1375 transitions. [2025-01-09 14:30:40,521 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1375 transitions. Word has length 276 [2025-01-09 14:30:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:40,522 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1375 transitions. [2025-01-09 14:30:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 14:30:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1375 transitions. [2025-01-09 14:30:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:40,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:40,525 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:40,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:30:40,725 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,SelfDestructingSolverStorable7 [2025-01-09 14:30:40,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:40,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1769224913, now seen corresponding path program 1 times [2025-01-09 14:30:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:40,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230507102] [2025-01-09 14:30:40,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:40,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:40,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:40,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:40,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:41,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230507102] [2025-01-09 14:30:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230507102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:41,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:30:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648226149] [2025-01-09 14:30:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:41,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:30:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:41,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:30:41,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:30:41,301 INFO L87 Difference]: Start difference. First operand 906 states and 1375 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:41,686 INFO L93 Difference]: Finished difference Result 1746 states and 2647 transitions. [2025-01-09 14:30:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:30:41,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 276 [2025-01-09 14:30:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:41,690 INFO L225 Difference]: With dead ends: 1746 [2025-01-09 14:30:41,690 INFO L226 Difference]: Without dead ends: 910 [2025-01-09 14:30:41,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:30:41,692 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 442 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:41,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 615 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-01-09 14:30:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 839. [2025-01-09 14:30:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 726 states have (on average 1.4545454545454546) internal successors, (1056), 728 states have internal predecessors, (1056), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 14:30:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1264 transitions. [2025-01-09 14:30:41,734 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1264 transitions. Word has length 276 [2025-01-09 14:30:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1264 transitions. [2025-01-09 14:30:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1264 transitions. [2025-01-09 14:30:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 14:30:41,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:41,738 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:41,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:30:41,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -4382681, now seen corresponding path program 1 times [2025-01-09 14:30:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896529263] [2025-01-09 14:30:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:41,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:41,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 96 proven. 15 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:30:42,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896529263] [2025-01-09 14:30:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896529263] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622548105] [2025-01-09 14:30:42,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:42,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:42,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:42,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:30:42,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:42,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:42,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:42,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:30:42,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1166 proven. 156 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2025-01-09 14:30:43,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:30:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-01-09 14:30:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622548105] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:30:43,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:30:43,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 17 [2025-01-09 14:30:43,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864405527] [2025-01-09 14:30:43,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:30:43,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:30:43,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:43,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:30:43,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:30:43,605 INFO L87 Difference]: Start difference. First operand 839 states and 1264 transitions. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 16 states have internal predecessors, (185), 5 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (94), 5 states have call predecessors, (94), 5 states have call successors, (94) [2025-01-09 14:30:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:45,398 INFO L93 Difference]: Finished difference Result 2224 states and 3290 transitions. [2025-01-09 14:30:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 14:30:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 16 states have internal predecessors, (185), 5 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (94), 5 states have call predecessors, (94), 5 states have call successors, (94) Word has length 277 [2025-01-09 14:30:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:45,407 INFO L225 Difference]: With dead ends: 2224 [2025-01-09 14:30:45,407 INFO L226 Difference]: Without dead ends: 1388 [2025-01-09 14:30:45,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=774, Invalid=2648, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 14:30:45,409 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1702 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:45,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1194 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:30:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-01-09 14:30:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1339. [2025-01-09 14:30:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1123 states have (on average 1.414959928762244) internal successors, (1589), 1128 states have internal predecessors, (1589), 186 states have call successors, (186), 29 states have call predecessors, (186), 29 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:30:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1961 transitions. [2025-01-09 14:30:45,495 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1961 transitions. Word has length 277 [2025-01-09 14:30:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:45,495 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1961 transitions. [2025-01-09 14:30:45,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 16 states have internal predecessors, (185), 5 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (94), 5 states have call predecessors, (94), 5 states have call successors, (94) [2025-01-09 14:30:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1961 transitions. [2025-01-09 14:30:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 14:30:45,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:45,499 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:45,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:30:45,699 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,SelfDestructingSolverStorable9 [2025-01-09 14:30:45,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:45,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -275763220, now seen corresponding path program 1 times [2025-01-09 14:30:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138439088] [2025-01-09 14:30:45,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:45,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:30:45,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:30:45,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:45,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138439088] [2025-01-09 14:30:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138439088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:46,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:46,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:30:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964626138] [2025-01-09 14:30:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:46,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:30:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:46,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:30:46,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:30:46,695 INFO L87 Difference]: Start difference. First operand 1339 states and 1961 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:47,558 INFO L93 Difference]: Finished difference Result 4416 states and 6384 transitions. [2025-01-09 14:30:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:30:47,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 279 [2025-01-09 14:30:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:47,570 INFO L225 Difference]: With dead ends: 4416 [2025-01-09 14:30:47,570 INFO L226 Difference]: Without dead ends: 3161 [2025-01-09 14:30:47,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:30:47,573 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 814 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:47,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 722 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:30:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2025-01-09 14:30:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 1963. [2025-01-09 14:30:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1740 states have (on average 1.4494252873563218) internal successors, (2522), 1745 states have internal predecessors, (2522), 186 states have call successors, (186), 36 states have call predecessors, (186), 36 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:30:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2894 transitions. [2025-01-09 14:30:47,724 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2894 transitions. Word has length 279 [2025-01-09 14:30:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:47,724 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2894 transitions. [2025-01-09 14:30:47,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2894 transitions. [2025-01-09 14:30:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 14:30:47,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:47,729 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:30:47,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:47,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash -253130966, now seen corresponding path program 1 times [2025-01-09 14:30:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545169209] [2025-01-09 14:30:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:30:47,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:30:47,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:47,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 2596 trivial. 0 not checked. [2025-01-09 14:30:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545169209] [2025-01-09 14:30:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545169209] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163302549] [2025-01-09 14:30:48,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:48,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:48,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:48,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:48,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:30:48,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:30:48,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:30:48,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:48,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:48,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:30:48,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:30:48,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163302549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:48,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-01-09 14:30:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579563985] [2025-01-09 14:30:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:48,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:30:48,809 INFO L87 Difference]: Start difference. First operand 1963 states and 2894 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:50,399 INFO L93 Difference]: Finished difference Result 5564 states and 8162 transitions. [2025-01-09 14:30:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:30:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 279 [2025-01-09 14:30:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:50,411 INFO L225 Difference]: With dead ends: 5564 [2025-01-09 14:30:50,411 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 14:30:50,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:30:50,414 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 1421 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:50,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 2235 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:30:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 14:30:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3146. [2025-01-09 14:30:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 2842 states have (on average 1.4377199155524278) internal successors, (4086), 2849 states have internal predecessors, (4086), 252 states have call successors, (252), 51 states have call predecessors, (252), 51 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 14:30:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4590 transitions. [2025-01-09 14:30:50,613 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4590 transitions. Word has length 279 [2025-01-09 14:30:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:50,613 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4590 transitions. [2025-01-09 14:30:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-01-09 14:30:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4590 transitions. [2025-01-09 14:30:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 14:30:50,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:50,617 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:50,626 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 14:30:50,817 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,SelfDestructingSolverStorable11 [2025-01-09 14:30:50,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:50,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1601827747, now seen corresponding path program 1 times [2025-01-09 14:30:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620115245] [2025-01-09 14:30:50,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:50,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:50,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:30:50,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:30:50,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:50,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 183 proven. 225 refuted. 0 times theorem prover too weak. 2404 trivial. 0 not checked. [2025-01-09 14:30:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:58,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620115245] [2025-01-09 14:30:58,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620115245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:58,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500648854] [2025-01-09 14:30:58,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:58,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:58,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:58,687 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 14:30:58,688 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 14:30:58,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:30:58,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:30:58,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:58,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:58,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 14:30:58,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1467 proven. 216 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2025-01-09 14:31:00,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:31:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 72 proven. 147 refuted. 0 times theorem prover too weak. 2593 trivial. 0 not checked. [2025-01-09 14:31:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500648854] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:31:01,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:31:01,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 45 [2025-01-09 14:31:01,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474299359] [2025-01-09 14:31:01,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:31:01,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 14:31:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:01,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 14:31:01,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 14:31:01,322 INFO L87 Difference]: Start difference. First operand 3146 states and 4590 transitions. Second operand has 45 states, 44 states have (on average 5.068181818181818) internal successors, (223), 44 states have internal predecessors, (223), 12 states have call successors, (96), 4 states have call predecessors, (96), 8 states have return successors, (98), 11 states have call predecessors, (98), 12 states have call successors, (98) [2025-01-09 14:31:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:15,799 INFO L93 Difference]: Finished difference Result 9890 states and 14148 transitions. [2025-01-09 14:31:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-01-09 14:31:15,800 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.068181818181818) internal successors, (223), 44 states have internal predecessors, (223), 12 states have call successors, (96), 4 states have call predecessors, (96), 8 states have return successors, (98), 11 states have call predecessors, (98), 12 states have call successors, (98) Word has length 279 [2025-01-09 14:31:15,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:15,840 INFO L225 Difference]: With dead ends: 9890 [2025-01-09 14:31:15,840 INFO L226 Difference]: Without dead ends: 6747 [2025-01-09 14:31:15,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=5344, Invalid=22046, Unknown=0, NotChecked=0, Total=27390 [2025-01-09 14:31:15,857 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 5991 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 5223 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5992 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 6057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 5223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:15,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5992 Valid, 3573 Invalid, 6057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 5223 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 14:31:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2025-01-09 14:31:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 5125. [2025-01-09 14:31:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 4540 states have (on average 1.4116740088105726) internal successors, (6409), 4549 states have internal predecessors, (6409), 430 states have call successors, (430), 154 states have call predecessors, (430), 154 states have return successors, (430), 421 states have call predecessors, (430), 430 states have call successors, (430) [2025-01-09 14:31:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7269 transitions. [2025-01-09 14:31:16,419 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7269 transitions. Word has length 279 [2025-01-09 14:31:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:16,419 INFO L471 AbstractCegarLoop]: Abstraction has 5125 states and 7269 transitions. [2025-01-09 14:31:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.068181818181818) internal successors, (223), 44 states have internal predecessors, (223), 12 states have call successors, (96), 4 states have call predecessors, (96), 8 states have return successors, (98), 11 states have call predecessors, (98), 12 states have call successors, (98) [2025-01-09 14:31:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7269 transitions. [2025-01-09 14:31:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 14:31:16,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:16,423 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:16,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 14:31:16,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:16,628 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:16,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 643751707, now seen corresponding path program 1 times [2025-01-09 14:31:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388964894] [2025-01-09 14:31:16,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:16,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:16,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:31:16,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:31:16,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 225 proven. 90 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-01-09 14:31:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388964894] [2025-01-09 14:31:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388964894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:31:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200650639] [2025-01-09 14:31:22,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:22,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:31:22,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 14:31:22,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:31:22,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:31:22,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:22,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:22,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 14:31:22,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1480 proven. 489 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2025-01-09 14:31:25,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:31:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 144 proven. 381 refuted. 0 times theorem prover too weak. 2287 trivial. 0 not checked. [2025-01-09 14:31:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200650639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:31:27,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:31:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 23] total 62 [2025-01-09 14:31:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939872761] [2025-01-09 14:31:27,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:31:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 14:31:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 14:31:27,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=3264, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 14:31:27,609 INFO L87 Difference]: Start difference. First operand 5125 states and 7269 transitions. Second operand has 62 states, 60 states have (on average 4.366666666666666) internal successors, (262), 59 states have internal predecessors, (262), 19 states have call successors, (107), 8 states have call predecessors, (107), 17 states have return successors, (108), 18 states have call predecessors, (108), 19 states have call successors, (108) [2025-01-09 14:31:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:53,630 INFO L93 Difference]: Finished difference Result 28265 states and 40274 transitions. [2025-01-09 14:31:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2025-01-09 14:31:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 4.366666666666666) internal successors, (262), 59 states have internal predecessors, (262), 19 states have call successors, (107), 8 states have call predecessors, (107), 17 states have return successors, (108), 18 states have call predecessors, (108), 19 states have call successors, (108) Word has length 279 [2025-01-09 14:31:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:53,675 INFO L225 Difference]: With dead ends: 28265 [2025-01-09 14:31:53,676 INFO L226 Difference]: Without dead ends: 23143 [2025-01-09 14:31:53,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14140 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=7789, Invalid=36101, Unknown=0, NotChecked=0, Total=43890 [2025-01-09 14:31:53,690 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 16550 mSDsluCounter, 5029 mSDsCounter, 0 mSdLazyCounter, 8053 mSolverCounterSat, 1286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16550 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 9339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1286 IncrementalHoareTripleChecker+Valid, 8053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:53,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16550 Valid, 5347 Invalid, 9339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1286 Valid, 8053 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-01-09 14:31:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23143 states. [2025-01-09 14:31:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23143 to 7426. [2025-01-09 14:31:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 6771 states have (on average 1.4170728105154335) internal successors, (9595), 6780 states have internal predecessors, (9595), 468 states have call successors, (468), 186 states have call predecessors, (468), 186 states have return successors, (468), 459 states have call predecessors, (468), 468 states have call successors, (468) [2025-01-09 14:31:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 10531 transitions. [2025-01-09 14:31:54,513 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 10531 transitions. Word has length 279 [2025-01-09 14:31:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:54,514 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 10531 transitions. [2025-01-09 14:31:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 4.366666666666666) internal successors, (262), 59 states have internal predecessors, (262), 19 states have call successors, (107), 8 states have call predecessors, (107), 17 states have return successors, (108), 18 states have call predecessors, (108), 19 states have call successors, (108) [2025-01-09 14:31:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 10531 transitions. [2025-01-09 14:31:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 14:31:54,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:54,523 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:54,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 14:31:54,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:54,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:54,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1650097451, now seen corresponding path program 1 times [2025-01-09 14:31:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037876907] [2025-01-09 14:31:54,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:54,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 14:31:55,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 14:31:55,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:55,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 14:31:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037876907] [2025-01-09 14:31:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037876907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:31:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764794426] [2025-01-09 14:31:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:55,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:31:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:55,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:31:55,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:31:55,239 INFO L87 Difference]: Start difference. First operand 7426 states and 10531 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38)